Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit d107bf7

Browse files
Update README.md
1 parent ef53906 commit d107bf7

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

‎README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# Python Pathfinding Algorithm Visualizer
22

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.
44

55
## The Project
66

@@ -26,4 +26,4 @@ Both the A* and Best First Search heuristic are based on the Manhattan distance
2626

2727
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.
2828

29-
![](application.png)
29+
![](https://github.com/andreidumitrescu95/Python-Pathfinding-Algorithm-Visualizer/blob/master/application.gif)

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /