Pathfinding Demonstration

This project visually demonstrates how various pathfinding algorithms search a grid. First, it will show which nodes are being searched and in which order. Then, once it finds the destination, it will show the path it came up with.

You can modify the grid by adding walls or water (which cost more to travel through than regular ground) or by moving the origin and destination. 

The algorithms used are Astar, Dijkstra, BFS, and DFS. If no algorithm is selected, it will default to AStar.