Shortest path problem

In graph theory, the shortest path problem is the problem of finding a path between two vertices in a graph such that the sum of the weights of its constituent edges is minimized.

Back to Route Planning & Optimization →

Source: Wikipedia · Image: Wikimedia Commons · CC BY-SA 3.0

TOROUTE

Navigation and route-planning, made practical — plain-English guides to GPS and satellite positioning, maps and coordinates, and the geo calculators every driver, hiker, and route planner reaches for.

Get new guides by emailOccasional emails. No spam. Unsubscribe anytime.

InformationAbout Contact Privacy Policy Terms of Service Disclaimer Affiliate Disclosure Cookie Policy

Every museum entry, image, and fact is drawn from Wikipedia and Wikimedia Commons, used under public-domain and Creative Commons licenses. No content is AI-generated.