Algorithms | Graph Minimum Spanning Tree | Question 4
In the graph given in above 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?
Path: 1 -> 0 -> 4 -> 2 Weight: 1 + 4 + 3
Quiz of this Question
Please comment below if you find anything wrong in the above post
My Personal Notes arrow_drop_up
Please Login to comment...