In this project I challenged myself to learn and implement the most popular path-finding algorithms without looking at any online implementation,
I have just looked at the theory of the path finding algorithms.
Note: My code isn't the most efficient, if you want to use a proper path finding algorithm look it up online, also python is the best language for these things
All you need to run this code on your device is:
- python
- pygame library (for the graphics)
After you run the main script (main.py) a pygme window will pop up, which will have a basic grid (I drew squares in a for loop)
you will also find start(blue) and end(red) nodes. In addition to an info panel in the left-down side of the window
The app contains 5 main node types to use:
- Normal node (white)
- Start node (blue)
- End node (red)
- Obstacle node (black)
- Weight node (Weight icon)
I currently have 3 algorithms:
- Dijkstra
- A*
- Greedy
First you need to choose the node type that you to draw by using the following controls:
| Node type | Keyboard key |
|---|---|
| Start | S |
| End | E |
| Obstacle | O |
| Weight | W |
After choosing the a node type, hold the left mouse button and hover over the nodes you want to replace
Use Right mouse button to remove Obstacle and Weight nodes
Choose the algorithm you want to use then press Enter
| Algorithm | Keyboard key |
|---|---|
| Dijkstra | 1 |
| A* | 2 |
| Greedy | 3 |
| Function | Key |
|---|---|
| Reset | R |
| Zoom in/out | Mouse scroll |
| Increase delay | Dot |
| Dencrease delay | Comma |
- The ability to Draw nodes
- The ability to switch between three different algorithms
- Obstacle and Weight nodes
- Control the delay time/speed of the visualization