Minimum Spanning Tree Algorithm

A Graph Algorithm. Find the [Minimum Spanning Tree] of a Graph, i.e. all Spanning Trees of a Graph with the minimum possible Edge Weight.

• Prim’s Algorithm
• Kruskal’s Algorithm
• Borůvka’s Algorithm

See also

Minimum Spanning Tree