engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Graphs/Spanning Tree and Shortest Paths Spanning Tree
Consider the following Adjacency matrix corresponding to some weight Graph ‘G’
|
Vertex |
1 |
2 |
3 |
4 |
5 |
|
1 |
0 |
5 |
0 |
10 |
2 |
|
2 |
5 |
0 |
4 |
6 |
2 |
|
3 |
0 |
4 |
0 |
1 |
0 |
|
4 |
10 |
6 |
1 |
0 |
7 |
|
5 |
2 |
2 |
0 |
7 |
0 |
The wight of the minimum spanning tree for the graph is ‘G’ is
1
8
2
9
3
10
4
11