Visualizing the greedy algorithm
- Install Java
- run (double-click) the "GreedyPathfinding.jar" file from this repository
- Left-click anywhere on the grid to create a node, the first one will be your starting node (green). The last node you create will be your end node (red).
- Right-click on two nodes to connect them.
- If you now click on start, the algorithm will follow the shortest edge until it has found your end node (red).