Kruskal's Algorithm
Kruskal's algorithm is used to find a minimum spanning tree
Kruskal's Algorithm
- Sort arcs into ascending weight
- Select arc of least weight to start
- Look at the next arc in the list:
- if the next arc forms a cycle, reject it
- otherwise, add it to the new graph
- Repeat step 3 until there are no more arcs left
