Medium Accuracy: 49.39%
Submissions: 33498 Points: 4
Given a weighted, undirected and connected graph of V vertices and E edges. The task is to find the sum of weights of the edges of the Minimum Spanning Tree.
Explanation:The Spanning Tree resulting in a weight
of 4 is shown above.
Only one Spanning Tree is possible
which has a weight of 5.
Since this is a functional problem you don't have to worry about input, you just have to complete the function spanningTree() which takes number of vertices Vandan adjacency matrix adj as input parameters and returns an integer denoting the sum of weights of the edges of the Minimum Spanning Tree. Here adj[i] contains a list of lists containing two integers where the first integer j denotes that there is an edge between i and j and second integer w denotes that the distance between edge i and j is w.
Expected Time Complexity: O(ElogV). Expected Auxiliary Space: O(V2).
2 ≤ V≤ 1000
V-1 ≤ E ≤ (V*(V-1))/2
1 ≤ w ≤ 1000
Graph is connected and doesn't contain self loops & multiple edges.