You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+2-2Lines changed: 2 additions & 2 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -1,6 +1,6 @@
1
1
# Python Pathfinding Algorithm Visualizer
2
2
3
-
I built this application for two main reasons: to get much more accomodated with python and to
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.
4
4
5
5
## The Project
6
6
@@ -26,4 +26,4 @@ Both the A* and Best First Search heuristic are based on the Manhattan distance
26
26
27
27
The application allows the user to place start, end and obstacle nodes on a grid. After placing the aforementioned nodes the user is able to select a pathfinding algorithm of his choice and start the visualization process. Once the algorithm is done, the application will display the time elapsed since the start of the algorithm and the total nodes visited in order to find the goal node. The user can now either reset the grid in order to test out another algorithm or exit completely out of the application.
0 commit comments