Home > Term: shortest spanning tree (SST)
shortest spanning tree (SST)
A minimum-weight tree in a weighted graph which contains all of the graph's vertices.
- Szófaj: noun
- Ipar/Tárgykör: Computer science
- Kategória: Algorithms & data structures
- Government Agency: NIST
0
Szerzőb
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
