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
+5-3Lines changed: 5 additions & 3 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -2,11 +2,11 @@
2
2
3
3
I built this application for two main reasons: to get much more accomodated with python and to
4
4
5
-
## The project
5
+
## The Project
6
6
7
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).
8
8
9
-
## Algorithms
9
+
## The Algorithms
10
10
11
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.
12
12
@@ -20,6 +20,8 @@ The project is implemented in Python using Pygame. We create a grid, we draw it
20
20
21
21
**Dijkstra's Algorithm** - the founding father of search algorithms, that guarantees the shortest path, albeit it being relatively slower than A*.
22
22
23
-
## The application
23
+
Both the A* and Best First Search heuristic are based on the Manhattan distance between two points.
24
+
25
+
## The Application
24
26
25
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