Kruskal's Algorithm

An algorithm used to find the minimum spanning tree

Steps:

1. Sort all edges by their weights in non-decreasing order
2. Pick the smallest edge. If it forms a cycle within spanning tree so far discard it
3. Keep doing step 2 until all nodes in the graph are connected