The MST (Minimum Spanning Tree) for the above graph is:
The first line of input contains an integer 'T' representing the number of the test case. Then the test cases are as follows. The first line of each test case argument given is an integer ‘N’ representing the number of nodes in the graph. The second line of each test case contains a given integer ‘M’ representing the number of edges. The next ‘M’ lines in each test case contain a matrix ‘E’ of size M x 2 which represents the ‘M’ edges such that there is an edge directed from node E[i] to node E[i].
For each test case, print the minimum spanning tree in the form of edges and their weights which are included in the MST.
You do not need to print anything; It has already been taken care of.
1 ≤ T ≤ 5 2 <= N <= 100 1 <= M <= min(1000, N(N - 1) / 2) 1 <= E[i], E[i] <= N Time Limit: 1 sec
Ninja and the experiment
Distance to a Cycle in Undirected Graph
Search In A Sorted 2D Matrix