A spanning tree from any connected, weighted graph that has the smallest total weight.
Prims algorithm
Prim’s Algorithm is used to find minimum spanning trees of a weighted graph.
Example
A connected, weighted graph that has its minimum spanning tree highlighted in red.
