Kruskal's Algorithm (MST Creation)

The Big Idea of this algorithm is to skip the graph traversal and instead operate on a global set of edges.

Algorithm Steps

• Sort all edges by weight
• For each edge (Ascending Order)
  1. Check whether nodes are already connected
  2. if they are, continue
  3. add edge to MST and combine the two sets

Learn more about Kruskal's Algorithm here: