Home > Term: single-destination shortest-path problem
single-destination shortest-path problem
Find the shortest path from each vertex in a weighted, directed graph to a specific destination vertex.
- 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
