https://github.com/andrewn6/astar-pathfinding

📁 A star path finding algorithim/visualizer written in python
https://github.com/andrewn6/astar-pathfinding

Last synced: 6 days ago
JSON representation

📁 A star path finding algorithim/visualizer written in python

• Host: GitHub
• URL: https://github.com/andrewn6/astar-pathfinding
• Owner: andrewn6
• License: other
• Created: 2021-03-08T00:38:00.000Z (almost 4 years ago)
• Default Branch: main
• Last Pushed: 2021-06-22T17:51:37.000Z (over 3 years ago)
• Last Synced: 2024-12-31T07:44:21.277Z (8 days ago)
• Language: Python
• Homepage:
• Size: 81.1 KB
• Stars: 3
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        

A start pathfinding visualiser in python.

This is the first attempt I implemented the a-star pathfinding algorithim, I created the visualiser with pygame. Although Big props to @Techwithtim for having an amazing tutorial on the algorithim. 

## Basic Controls

You must create a map to start the pathfinding! The start node is orange, end node is turqoise and the walls/drawing are black. 

To create nodes:

  - Left click (Create the start node with left click, Then the end node with left click)

 

 To delete nodes

  - It is the same as creation, Except right click!

 

 

 > Note: Unfortunately My algorithm does not support diagnol path finding, Only non diagnol path finding.

 

A start pathfinding visualiser in python.

This is the first attempt I implemented the a-star pathfinding algorithim, I created the visualiser with pygame. Although Big props to @Techwithtim for having an amazing tutorial on the algorithim. 

## Basic Controls

You must create a map to start the pathfinding! The start node is orange, end node is turqoise and the walls/drawing are black. 

To create nodes:

  - Left click (Create the start node with left click, Then the end node with left click)

 

To delete nodes:

  - It is the same as creation, Except right click!

 

## Colors

Each color represents something in the program.

- Red (Checks if its closed if the color is read)

- Green (If open the color is green)

- Black (if there is a barrier for the path it will be black)

- Turqoise (Represents the end of the path finding, this will show up if that path gets found)

- White (Represents if the path is reset)

This list isn't exhaustive, But shows the most important colors.

- 

 > Note: Unfortunately My algorithm does not support diagonal path finding, Only non diagonal path finding.

 

https://github.com/andrewnijmeh/astar-pathfinding/blob/main/Screenshots/screen.gif

 *a project by Andrew Nijmeh.*