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.

0 0

Looja

  • GeorgeV
  •  (Gold) 1123 points
  • 100% positive feedback
© 2024 CSOFT International, Ltd.