Algorithms | Graph Minimum Spanning Tree | Question 4

In the graph given in above question question, what is the minimum possible weight of a path P from vertex 1 to vertex 2 in this graph such that P contains at most 3 edges?
(A) 7
(B) 8
(C) 9
(D) 10


Answer: (B)

Explanation: Path: 1 -> 0 -> 4 -> 2
Weight: 1 + 4 + 3

Quiz of this Question

My Personal Notes arrow_drop_up

Recommended Posts: