LEGEND
| Start Node: |
| End Node: |
 | Node with Resistance(3): |
| Node with Resistance(5): |
| Wall Node: | |
| Visited Node: | |
| Visited Node w/ Resistance: |
| Open/Unvisited Node: |
| Shortest Path: | |
| Shortest Path Resisted (3): |
| Shortest Path Resisted (5): |
| Start Node: |
| End Node: |
| Node with Resistance(3): |
| Node with Resistance(5): |
| Wall Node: | |
| Visited Node: | |
| Visited Node w/ Resistance: |
| Open/Unvisited Node: |
| Shortest Path: | |
| Shortest Path Resisted (3): |
| Shortest Path Resisted (5): |
This application is designed to show how path finding algorithms behave so you can easily analyze it. Proceed forward to view the tutorial on how to use the application. You may also choose to skip the tutorial and go straight to the path finding action!