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.
- Sõnaliik: noun
- Valdkond/domeen: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Looja
- GeorgeV
- 100% positive feedback