Pathfinding

Shortest Path in Matrix

Discover the most efficient route through a binary maze. By treating each empty cell as a node and adjacent cells as edges of weight 1, BFS identifies the absolute shortest distance in O(V+E) time.

BFS ComplexityO(M × N)

MetricL1 Distance

Grid Representation

0 represents an open path, while 1 represents an impassable wall. We only explore cells that are within boundaries and not blocked.

Wave Propagation

BFS acts like a wave spreading outward from the start. The first time the "wave" hits a cell, we've found its shortest distance.

🧱

Loading Lab...

Pathfinding

Shortest Path in Matrix

BFS ComplexityO(M × N)

MetricL1 Distance

Grid Representation

0 represents an open path, while 1 represents an impassable wall. We only explore cells that are within boundaries and not blocked.

Wave Propagation

BFS acts like a wave spreading outward from the start. The first time the "wave" hits a cell, we've found its shortest distance.

🧱

Shortest Path Matrix

Shortest Path Matrix

Shortest Path in Matrix

Grid Representation

Wave Propagation

Shortest Path in Matrix

Grid Representation

Wave Propagation