DIJKSTRA

PATHFINDING VISUALIZER

STATUS
START
NODES
0
PATH
0
TIME
0ms
START
TARGET
WALL
EXPLORED
PATH
▶ SELECT START MODE AND CLICK A CELL

HOW IT WORKS

Interactive Grid

  • Start & Target: Select the mode button then click any cell.
  • Walls: Click and drag across the grid to draw barriers.
  • Cells are connected to their 4 non-diagonal neighbors. No diagonals — we're not monsters.

Algorithms

Dijkstra

Radiates outwards, guarantees shortest path. The OG.

BFS

Level by level. Also guarantees shortest path on unweighted grids.

DFS

Goes deep before backtracking. Fast but chaotic. Does NOT guarantee shortest path.

Bellman-Ford

Edge relaxation logic via SPFA. Handles negative weights (not that we have any here).