A planar graph and its minimum spanning tree. Each edge is labeled with its weight, which here is roughly proportional to its length.
A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight.[1] That is, it is a spanning tree whose sum of edge weights is as small as possible.[2] More generally, any edge-weighted undirected graph (not necessarily connected) has a minimum spanning forest, which is a union of the minimum spanning trees for its connected components.
There are many use cases for minimum spanning trees. One example is a telecommunications company trying to lay cable in a new neighborhood. If it is constrained to bury the cable only along certain paths (e.g. roads), then there would be a graph containing the points (e.g. houses) connected by those paths. Some of the paths might be more expensive, because they are longer, or require the cable to be buried deeper; these paths would be represented by edges with larger weights. Currency is an acceptable unit for edge weight – there is no requirement for edge lengths to obey normal rules of geometry such as the triangle inequality. A spanning tree for that graph would be a subset of those paths that has no cycles but still connects every house; there might be several spanning trees possible. A minimum spanning tree would be one with the lowest total cost, representing the least expensive path for laying the cable.
^"scipy.sparse.csgraph.minimum_spanning_tree - SciPy v1.7.1 Manual". Numpy and Scipy Documentation — Numpy and Scipy documentation. Retrieved 2021-12-10. A minimum spanning tree is a graph consisting of the subset of edges which together connect all connected nodes, while minimizing the total sum of weights on the edges.
^"networkx.algorithms.tree.mst.minimum_spanning_edges". NetworkX 2.6.2 documentation. Retrieved 2021-12-13. A minimum spanning tree is a subgraph of the graph (a tree) with the minimum sum of edge weights. A spanning forest is a union of the spanning trees for each connected component of the graph.
and 20 Related for: Minimum spanning tree information
A minimumspanningtree (MST) or minimum weight spanningtree is a subset of the edges of a connected, edge-weighted undirected graph that connects all...
graph may have several spanningtrees, but a graph that is not connected will not contain a spanningtree (see about spanning forests below). If all of...
A Euclidean minimumspanningtree of a finite set of points in the Euclidean plane or higher-dimensional Euclidean space connects the points by a system...
In mathematics, a random minimumspanningtree may be formed by assigning independent random weights from some distribution to the edges of an undirected...
tree problem in graphs is equivalent to the minimumspanningtree. However, while both the non-negative shortest path and the minimumspanningtree problem...
weighted edge in a spanningtree. A spanningtree is a minimum bottleneck spanningtree if the graph does not contain a spanningtree with a smaller bottleneck...
The SpanningTree Protocol (STP) is a network protocol that builds a loop-free logical topology for Ethernet networks. The basic function of STP is to...
A kinetic minimumspanningtree is a kinetic data structure that maintains the minimumspanningtree (MST) of a graph whose edge weights are changing as...
Capacitated minimumspanningtree is a minimal cost spanningtree of a graph that has a designated root node r {\displaystyle r} and satisfies the capacity...
Wikimedia Commons has media related to Multiple SpanningTree Protocol. The Multiple SpanningTree Protocol (MSTP) and algorithm, provides both simple...
In graph theory a minimumspanningtree (MST) T {\displaystyle T} of a graph G = ( V , E ) {\displaystyle G=(V,E)} with | V | = n {\displaystyle |V|=n}...
implementation for an Expected Linear-Time MinimumSpanningTree Algorithm(Karger-Klein-Tarjan + Hagerup MinimumSpanningTree Verification as a sub-routine)"....
Using min heap priority queue in Prim's algorithm to find the minimumspanningtree of a connected and undirected graph, one can achieve a good running...
This is also known as the degree-constrained spanningtree problem. Finding the minimum degree spanningtree of an undirected graph is NP-hard. This can...
distance spanningtree, shortest total path length spanningtree, minimum total distance spanningtree, or minimum average distance spanningtree. In an...
minimax path weight in the minimumspanningtree of the metric. From the minimumspanningtree, one can construct a Cartesian tree, the root node of which...
optimization problems are the travelling salesman problem ("TSP"), the minimumspanningtree problem ("MST"), and the knapsack problem. In many such problems...
Global Information