Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

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?

(A)



7

(B)



8

(C)

9

(D)

10

Answer: (B)
Explanation:

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

Article Tags :
DSA Quiz
Recommended Articles
1. Algorithms | Graph Minimum Spanning Tree | Question 1
2. Algorithms | Graph Minimum Spanning Tree | Question 2
3. Algorithms | Graph Minimum Spanning Tree | Question 3
4. Algorithms | Graph Minimum Spanning Tree | Question 5
5. Algorithms | Graph Minimum Spanning Tree | Question 6
6. Algorithms | Graph Minimum Spanning Tree | Question 7
7. Algorithms | Graph Minimum Spanning Tree | Question 8
8. Maximum Possible Edge Disjoint Spanning Tree From a Complete Graph
9. Minimum spanning tree cost of given Graphs
10. Properties of Minimum Spanning Tree (MST)
11. Total number of Spanning trees in a Cycle Graph
12. Number of spanning trees of a weighted complete Graph
13. Maximum Spanning Tree using Prim’s Algorithm
14. Algorithms | Graph Shortest Paths | Question 14
15. Algorithms | Graph Traversals | Question 2
16. Algorithms | Graph Traversals | Question 12
17. Algorithms | Graph Shortest Paths | Question 2
18. Algorithms | Graph Shortest Paths | Question 3
19. Algorithms | Graph Traversals | Question 12
20. Algorithms | Graph Shortest Paths | Question 4
21. Algorithms | Graph Traversals | Question 12
22. Algorithms | Graph Traversals | Question 12
23. Algorithms | Graph Shortest Paths | Question 14
24. Algorithms | Graph Shortest Paths | Question 8
25. Algorithms | Graph Shortest Paths | Question 9