Home > Term: single-pair shortest-path problem
single-pair shortest-path problem
The problem of finding the shortest path in a graph from one vertex to another. "Shortest" may be least number of edges, least total weight, etc.
- Szófaj: noun
- Ipar/Tárgykör: Computer science
- Kategória: Algorithms & data structures
- Government Agency: NIST
0
Szerzőb
- GeorgeV
- 100% positive feedback