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 7Maximum flow problemCompared with: It optimizes the cost of one route rather than the total amount routed through a network.Transportation problemCompared with: It routes a single flow along connected arcs rather than allocating quantities across source-destination pairs.Flow networkCompared with: It optimizes route length rather than total transmitted quantity.Vehicle routing problemCompared with: A shortest-path problem connects a given pair, while routing coordinates visits to many locations.Hamiltonian pathCompared with: It optimizes distance between endpoints rather than requiring a visit to every vertex.Kruskal's algorithmCompared with: A minimum spanning tree minimizes total network weight, not individual path distances.Hamiltonian path problemCompared with: Unlike Hamiltonian path, it does not require visiting every vertex.