Minimum Spanning Trees
Kruskal's Algorithm Steps
- In non-decreading ordering of their weight sort all the graph edges
- Pick the smallest edge and if that doesn't help a cycle then add it to the tree.
- Continue repeating these steps until tree will have V-1 edges.
Read more about this on Minimum Spanning Trees.