Kruskal's Algorithm

Example of a graph Kruskal's Algorithm might be used on:

Steps for Kruskal's Algorithm:

1. Sort the edges by weight
2. For each edge (in ascending order)
• 2.1 check whether nodes are already connected
• 2.2 if they are, continue
• 2.3 add edge to mst, and combine the two sets

You can find more information about Kruskal's Algorithm here.