PathFindingVisualizer

Pathfinding

Pathfinding is used in many different cases, ranging from transportation (Uber) and map directions (Google Maps) to sending files through a network efficently. I aimed to create a program that will allow the user to see what is going on behind the scenes during the algorithms. I implemented A* search, Breadth First Search and Bidirectional Breadth First Search. I hope more people will be able to appreciate graph theory through this project.

Controls

Holding down C + mouse move will automatically create walls as you move past the tiles

Holding down E + mouse move will automatically erase walls as you move past the tiles

Clicking on the Start and End points will allow you to change them to different places

Clicking A will set the algorithm to A*, clicking B will set the algorithm to BFS, and clicking D will set the algorithm to Bidirectional BFS.

Demos

A* search

Breadth First Search

Bidirectional Breadth First Search