Minimum Spanning Tree: Difference between revisions
From Rice Wiki
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
A '''minimum spanning tree''' is | A '''minimum spanning tree''' is | ||
* a tree, meaning it has no cycle | * a tree, meaning it has no cycle | ||
* minimum, meaning it has minimum weight | * minimum, meaning it has minimum weight | ||
* spanning, meaning it connects all nodes | * spanning, meaning it connects all nodes | ||
[[Category:Algorithms]] | [[Category:Algorithms]] | ||
Revision as of 00:56, 6 March 2024
A minimum spanning tree is
- a tree, meaning it has no cycle
- minimum, meaning it has minimum weight
- spanning, meaning it connects all nodes
