Difference between revisions of "Minimum spanning tree"
From Encyclopedia of Mathematics
(expand with definition) |
m (link) |
||
| Line 1: | Line 1: | ||
''shortest spanning tree'' | ''shortest spanning tree'' | ||
| − | In a graph $G$ with weights assigned to the edges, a [[spanning tree]] with minimum total edge weight. | + | In a [[graph]] $G$ with weights assigned to the edges, a [[spanning tree]] with minimum total edge weight. |
See [[Tree]]. | See [[Tree]]. | ||
Latest revision as of 12:42, 29 December 2014
shortest spanning tree
In a graph $G$ with weights assigned to the edges, a spanning tree with minimum total edge weight.
See Tree.
How to Cite This Entry:
Minimum spanning tree. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Minimum_spanning_tree&oldid=35939
Minimum spanning tree. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Minimum_spanning_tree&oldid=35939