x

Kruskal's Algorithm

Kruskal's algorithm is used to find a minimum spanning tree

Kruskal's Algorithm
  1. Sort arcs into ascending weight
  2. Select arc of least weight to start
  3. Look at the next arc in the list:
  4. if the next arc forms a cycle, reject it
  5. otherwise, add it to the new graph
  6. Repeat step 3 until there are no more arcs left


Left-click: follow link, Right-click: select node, Scroll: zoom
x