Dijkstra vs BFS — The Golden Route

Same weighted graph. BFS ignores weights. Dijkstra minimizes total cost.

Build

Graph preset

View

Node count

Edge density

0.35

Weight range

1..14

Seed: —

Speed

1.7×

Reveal duration

0.95s

Stop when goal is certified

Uncheck to keep exploring and show more variations.

Coach: Build a weighted graph. Then Run. BFS minimizes hops, Dijkstra minimizes cost.

Watch the lasers: Dijkstra performs “relaxation” when it finds a cheaper cost.

BFS Queue (front → back)

—

Dijkstra Priority Queue (min first)

—

BFS visited

Dijkstra finalized

BFS path (hops)

—

Dijkstra path (cost)

—