Shortest path finding visualizer

Unweighted Dijkstra’s algorithm on a grid with walls — visualizes the shortest path between start and goal.

Technologies: Java, Swing.