Minimum spanning tree
Summary
A minimum spanning tree of a weighted connected graph is a spanning tree of least total weight. It is a classical problem of combinatorial optimization, solved by greedy algorithms. The node minimum spanning tree gives the precise definition.
Further reading
- Web https://en.wikipedia.org/wiki/Minimum_spanning_tree, lead section
About this page
| Tag | 0JW7KT6PQW |
|---|---|
| URI | m2://0JW7KT6PQW |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C05 |
| Specializes | Spanning tree |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.