Shortest path computed on a bike graph (motorways excluded). Weights = great-circle (Haversine) distances.
Start
—
Goal
—
Shortest distance (km)
—
Stops (nodes)
—
Reason Why
We model cities as nodes and intercity connections as weighted, undirected edges.
The bike graph excludes edges flagged as motorways. We use Dijkstra to find the shortest path,
then verify with A* (admissible straight-line heuristic), Bellman–Ford, and Floyd–Warshall.
Independent Checks
Route Map (SVG)
bike-allowed edges
motorways (not allowed)
chosen shortest path
city