Computer Sciences > GATE 2025 SET-2 > Graph Theory
The diagram below shows a river system consisting of 7 segments, marked P, Q, R, S, T, U, and V. It splits the land into 5 zones, marked Z1, Z2, Z3, Z4, and Z5. We need to connect these zones using the least number of bridges. Out of the following options, which one is correct?
Note: The figure shown is representative.
A
Bridges on P, Q, and T
B
Bridges on P, Q, S, and T
C
Bridges on Q, R, T, and V
D
Bridges on P, Q, S, U, and V

Correct : c

Similar Questions

Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time on Depth First Search of G? Assume that the graph is represen...
#14 MCQ
Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time on Depth First Search of G? Assume that the graph is represen...
#14 MCQ
Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time on Depth First Search of G? Assume that the graph is represen...
#14 MCQ

Related Topics

No tags found

Unique Visitor Count

Total Unique Visitors

Loading......