Compute the minimum spanning tree weight of a weighted, undirected, connected graph with Prim's algorithm, growing the tree one vertex at a time from an arbitrary start.
Loading content...