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.
- Jenis Kata: noun
- Industri / Domain: Sains komputer
- Kategori: Algorithms & data structures
- Government Agency: NIST
0
Penulis
- GeorgeV
-
(Gold) 1123 poin - 100% positive feedback
