Gridlock Pathfinder

Overview

A pathfinding algorithm visualizer using a 2D matrix.

You check it out here.

Algorithms Utilized

Breadth First Search (8-Connectivity)

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

Breadth First Search (4-Connectivity)

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

Brute Force Linear Scan

• 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.

Demonstration GIFs

Breadth First Search (8-Connectivity) Demo

Breadth First Search (4-Connectivity) Demo

Brute Force Linear Scan Demo