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