ROUTS

Interactive pathfinding on OpenStreetMap: A*, Dijkstra, bidirectional search, and more. Enable JavaScript to use the map at routs.dev.

By Alatic.

Loading map…

ROUTS

by Alatic

60 FPS

Route

Start

Destination

Click the map to set start (A) and destination (B)

Distance-

ETA-

Segments-

Intersections-

Avg speed-

Traffic delay-

Alg. cost-

Algorithm

Search direction

Cyan from A + orange from B until the searches meet.

Turn costs Prefer major roads

Simulation

Traffic

Enable traffic Global intensity 55%

Scatter incidents

Set how many of each, then scatter into the loaded area (spaced out, major roads preferred).

Crashes

Traffic jams

Closures

Construction

Lane close

Place on selected road

Road Data

-

Traffic colors Speed limit colors Speed labels

Visualization

Traffic Search Nodes Search Edges Heatmap Final Route Graph Nodes Incidents FPS Counter

Camera

Vehicle

Live Statistics

AlgorithmA*

StatusIDLE

Elapsed0.000 s

Nodes Visited0

Nodes Queued0

Edges Checked0

Paths Rejected0

Current Best Cost-

Est. Remaining-

Total Graph Nodes0

Total Graph Edges0

Memory Used-

Ops / Second0

Inspector

Click a road segment during search…

Charts

Alternatives

Algorithm Race

SPEED0km/h

LIMIT0km/h

ROAD-

ETA-

LEFT-

TRAFFIC-

RECALCULATING…

Algorithm Timeline Ready

Space play/pause · ← → step · R restart · F follow · 1-9 speed

Go to a place

Cities, countries, or any named location

Search

Pick a popular city or search the world.

Countries & huge metros load a central street sample: pan and use Load this view to expand.

Custom bounding box

Fetch roads for an exact OSM bbox (advanced).

South West North East

Keep the box small (~2 km). Prefer Places search for cities.

ROUTS

Pathfinding on real maps · by Alatic

Map Defaults to Los Angeles. Use Places for any city/country, My Location, or Load this view while panning.
A / B Click map for start then destination, or type a road name and press Enter.
Algorithm Pick one and a search direction (A→B, B→A, or A↔B).
Run Find Route for the result, or Start Visualization to watch the search.

Cyan branches = from A. Orange = from B. Blue = final route.

A*: Cost so far + estimate to goal. Good default.
Dijkstra: Cheapest cost first. Optimal, explores more.
Greedy Best First: Chases closest-looking node. Fast, not always optimal.
ALT: A* with landmark distances for a tighter heuristic.
Bidirectional A* / Dijkstra: Search from both ends until they meet.
Prim’s: Grows a cheap-edge tree until B is reached.
Cascade: Custom: Prim-like start, then bias toward B on major roads.

Click map	Set start / destination
Drag / scroll	Pan / zoom
Space	Play / pause
← →	Step back / forward
R	Restart
F	Follow search
1-9	Speed
Timeline	Scrub search events

Runs entirely in your browser. Nothing is sent to a ROUTS server: there isn’t one. GPS is only used if you ask for it (My Location / Locate me).

When you load roads, your map bbox is requested from public Overpass mirrors (and map tiles from Esri / similar). Those third parties can see the area you asked for: not a ROUTS backend.

by Alatic · routs.dev