KnowraShortest path problemLinked fromLinked fromThe 28 pages that link to Shortest path problem, each with the reason it gives.All 28Broader topic 1Related 15Narrower topic 5Compared with 7Breadth-first searchNarrower topic: Breadth-first search solves it when every edge has equal cost.Dijkstra's algorithmNarrower topic: Dijkstra's algorithm is one method for the single-source version of this broader problem.Edsger W. DijkstraNarrower topic: Dijkstra’s algorithm solves this problem for nonnegative edge weights.Bellman–Ford algorithmNarrower topic: Bellman–Ford solves the single-source version of this broader optimization problem.Floyd–Warshall algorithmNarrower topic: Floyd–Warshall solves this problem simultaneously for every ordered pair of vertices.