Minimum Spanning Trees

Kruskal's and Prim's AlgorithmsSign up

be able to apply Kruskal's algorithm to find a minimum spanning tree of a weighted connected graph, expressing the result both as a list of selected edges and as a diagram · be able to apply Prim's algorithm (both on a graph and from a network distance matrix) to find a minimum spanning tree