Use this tag whenever your question is related to minimum spanning tree (MST). An MST of a connected edge-weighted graph G is a spanning tree whose sum of edge weights is as small as possible. We usually assume $G$ is finite, simple and undirected.
Stats
|
created |
6 years, 7 months ago by so.very.tired |
|
viewed |
15 times |
|
editors |
0 |
Top Answerers
more »
Recent Hot Answers
Does a graph always have a minimum spanning tree that is binary?Why do we have different algorithm for MST when graphs are directed?
When is the minimum spanning tree for a graph not unique
Do Kruskal's and Prim's algorithms yield the same minimum spanning tree?
Are all MST minimum spanning trees reachable by Kruskal and Prim?
more »