Linked from

The 28 pages that link to Shortest path problem, each with the reason it gives.

• Graph theoryRelated: It models route planning when edges represent distance, time, or cost.

• GeodesicRelated: On suitable spaces, geodesics provide local solutions to shortest-path problems.

• Graph (discrete mathematics)Related: Routing is a direct use of paths and edge weights.

• Arc lengthRelated: Arc length supplies the path cost when comparing routes through continuous space.

• Edge (graph theory)Related: Edge lengths or weights determine the cost of each candidate route.

• DistanceRelated: Many distance calculations reduce to finding a shortest route through a space.

• Dynamic programmingRelated: Shortest-path algorithms use recursive optimality across paths and graph states.

• Path (graph theory)Related: A path becomes an optimization object when its length or weight is minimized.

• Road networkRelated: Road routing uses it to find paths by distance, time, or another cost.

• Weighted graphRelated: It treats edge weights as costs and combines them along candidate paths.

• Transportation networkRelated: Route-finding methods select paths through a network using distance, time, or cost.

• A* search algorithmRelated: A* solves this problem when its heuristic and search conditions support optimality.

• Richard BellmanRelated: Dynamic programming solves it by relating each route to smaller path problems.

• Hopf–Rinow theoremRelated: The theorem guarantees a minimizing geodesic between any two points under completeness.

• Chinese checkersRelated: Efficient routes through the board reduce the distance pieces must travel to the opposite arm.