Minimum Spanning Tree (MST)
A minimum spanning tree (MST) is a subset of the edges of a connected, edge-weighted graph that connects all the vertices together without any cycles and with the minimum possible total edge weight.
UGM
Undirected, General MST
55 Algorithms
UDM
Undirected, Dense MST
47 Algorithms
UPM
Undirected, Planar MST
1 Algorithms
- Undirected, General MST
- UDMUndirected, Dense MST
47 Algorithms
- UIWUndirected, Integer Weights MST
1 Algorithms
- UPMUndirected, Planar MST
1 Algorithms
DOB
Directed (Optimum Branchings), General MST
4 Algorithms
ABV
all but very sparse graphs
1 Algorithms