📌Highlights: Hi friends ! In this post I am going to explain about Minimum Spanning tree using greedy approach such Prim's and Kruskal's algorithm in Analysis Design of Algorithm.
Let we first understand , what is spanning tree ?
A sub graph suppose S of graph G having V vertices and E edges is said to be spanning tree if following properties must be satisfied.
1. S must contain all vertices of G.
2. S must contain (|V|-1) edges.
3. There is no close loop inside S.
