Minimum Spanning Trees

For weighted graphs, in addition to shortest paths, the problem of constructing a minimum spanning tree is important. Prim's and Kruskal's algorithms offer different strategies for edge selection with the same objective function