Dynamic Exploration of Travelers Operating Upon Routes

DETOUR

The graph learns from arriving travelers. They branch at each junction, and the first complete route to settle has the best cost.

engine
wasm in a Web Worker
settled retired traveler learned detour returned route
0

Side by side

Run the same contract through other algorithms. Exact methods prove optimality; heuristics only find a route.