Inicio > 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.
- Parte del discurso: noun
- Industria/ámbito: Ciencia informática
- Categoría: Algoritmos & Estructura de Datos
- Government Agency: NIST
0
Creador
- GeorgeV
-
(Gold) 1123 puntos - 100% positive feedback
