A pathfinding algorithm visualizer using a 2D matrix.

You check it out here.

• Generates an auxiliary adjacency list to find the shortest path via mapping and queuing. Takes into consideration diagonal directions.

• Generates an auxiliary adjacency list to find the shortest path via mapping and queuing.

• Traverses the adjacency matrix to find a path from the start node to the end node.

For more reading on the BFS algorithm, click here.