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/ for explanation.

Quiz of this Question

My Personal Notes arrow_drop_up