← Lab · Chapter: Minimum spanning trees

Minimum spanning trees: Kruskal and Prim

Kruskal on the edges sorted by weight, with the components and the rejected edges; Prim with the labels d(v), pred(v) and the cut; the weight of the tree. Choose Kruskal or Prim (and Prim's start vertex); ◀ ▶ one step at a time, «Run» to watch them all; the «Instance» menu, «Random» and «Edit…» change the graph.