Algorithms | Graph Minimum Spanning Tree | Question 2

The length of the path from v5 to v6 in the MST of previous question with n = 10 is
(A) 11
(B) 25
(C) 31
(D) 41

Answer: (C)
Explanation: See question 2 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-27/amp/ for explanation.
Quiz of this Question

Article Tags :

DSA Quiz

Algorithms-Graph Minimum Spanning Tree

Graph Minimum Spanning Tree

Recommended Articles

1. Algorithms | Graph Minimum Spanning Tree | Question 1

2. Algorithms | Graph Minimum Spanning Tree | Question 3

3. Algorithms | Graph Minimum Spanning Tree | Question 4

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