Algorithms · INTERACTIVE 2D SIMULATION

Dijkstra Shortest Path Algorithm Visualizer

Generate a maze and watch Dijkstra’s algorithm explore the graph and recover the shortest route.

LIVE MODELAdjust parameters · observe the system · learn by experimenting

What you are exploring

Dijkstra’s algorithm repeatedly visits the unprocessed node with the smallest known distance, then relaxes its neighbours. With non-negative edge weights, the resulting path is guaranteed to be shortest. This grid uses equal-cost four-direction movement.

Made with 🤖 ChatGPT