|
1 | 1 | # Python Pathfinding Algorithm Visualizer |
2 | 2 |
|
3 | | -I built this application in order to get much more accomodated with Python and Pygame and to have a much better understanding of the nature of various pathfinding algorithms through visualization. |
| 3 | +I built this application in order to get much more accommodated with Python and Pygame and to have a much better understanding of the nature of various pathfinding algorithms through visualization. |
4 | 4 |
|
5 | 5 | ## The Project |
6 | 6 |
|
7 | | -The project is implemented in Python using Pygame. We create a grid, we draw it to the screen and depending on the algorithm the user will be able to visualize several pathfinding algorithms in action and analyze the results (time elapsed, nodes visited, time and space complexity). |
| 7 | +The project is implemented in Python using Pygame. The program creates a grid, draws it to the screen and depending on the chosen algorithm the user will be able to visualize it in action and analyze the results (time elapsed, nodes visited, time and space complexity). |
8 | 8 |
|
9 | 9 | ## The Algorithms |
10 | 10 |
|
11 | | -**A*** **Search** - the best pathfinding algorithm as it always finds the shortest path and does it much faster than Dijkstra by using a heuristic function that aproximates the distance between the currently probed node and the end node. |
| 11 | +**A*** **Search** - the best pathfinding algorithm as it always finds the shortest path and does it much faster than Dijkstra by using a heuristic function that approximates the distance between the currently probed node and the end node. |
12 | 12 |
|
13 | 13 | **Best First Search** - also uses a heuristic function to determine the approximate distance between nodes, but does not guarantee neither the shortest path, nor finding the actual end node. |
14 | 14 |
|
|
0 commit comments