0
4.6kviews
To find MST of following graph using prims Algorithm.
written 7.8 years ago by | • modified 4.1 years ago |
To find MST of following graph using prim’s Algorithm.
ADD COMMENT
EDIT
1 Answer
written 7.8 years ago by | • modified 4.1 years ago |
To find MST of following graph using prim’s Algorithm.
written 7.8 years ago by |
Minimum Spanning Tree using Prim’s Algorithm:
Sr No. | Edges considered | Edges selected | Cost | Spanning tree | |
---|---|---|---|---|---|
1 | - | - | - | ||
2 | (1, 2) , (1, 6)0 | (1, 6) | 10 | ||
3 | (1, 2), (6, 5) | (6, 5) | 15 | ||
4 | (1, 2), (5, 4), (5, 7) | (5, 4) | 22 | ||
5 | c | (4, 3) | 12 | ||
6 | (1, 2), (3, 2) (4, 7), (5, 7) | c | 16 | ||
7 | (1, 2), (2, 1), (2, 7) (4, 7), (5, 7) | (2, 7) | 14 | ||
8 | $ \ \ \ \ \ \ \ \ \ \ $Minimum Spanning Tree in the graph with total cost is 89. | v |