KnowraDijkstra's algorithmLinked fromLinked fromThe 19 pages that link to Dijkstra's algorithm, each with the reason it gives.All 19Broader topic 6Related 6Compared with 7Breadth-first searchCompared with: It extends distance-prioritized exploration to graphs with unequal edge costs.Depth-first searchCompared with: DFS does not account for path costs and cannot guarantee shortest paths.A* search algorithmCompared with: It is A* with a zero heuristic, so it explores without goal-directed guidance.Bellman–Ford algorithmCompared with: It is typically faster but requires nonnegative edge weights for correctness.Floyd–Warshall algorithmCompared with: Unlike Floyd–Warshall, it solves from one source and cannot handle negative edges safely.Prim's algorithmCompared with: Its similar greedy selection rule solves shortest paths, not the minimum spanning tree problem.Tony HoareCompared with: Unlike Quicksort, it solves a graph optimization problem rather than sorting a sequence.