Pathfinding Visualizer

Demonstrates with animation how Djikstra, A*, Breadth-First and Depth-First algorithms find the path from start point to end point in a grid graph. It's possible to increase the weights of the nodes or remove them.