PathFinding Simulator

This simulator provides the grid (optimal for simulating roads) and the sparse (optimal for simulating subnets) environment with a Dijkstra and A* animation. The A* algorithm is implemented with an euclidean distance heuristic.