https://github.com/sumitgirwal/a-star-path-find-algo-python

A* is a graph traversal and path search algorithm, which is often used in many fields of computer science due to its completeness, optimality, and optimal efficiency.
https://github.com/sumitgirwal/a-star-path-find-algo-python

algorithm astar-algorithm pygame-games python-3

Last synced: 9 months ago
JSON representation

A* is a graph traversal and path search algorithm, which is often used in many fields of computer science due to its completeness, optimality, and optimal efficiency.

• Host: GitHub
• URL: https://github.com/sumitgirwal/a-star-path-find-algo-python
• Owner: sumitgirwal
• Created: 2020-11-05T08:01:02.000Z (about 5 years ago)
• Default Branch: master
• Last Pushed: 2022-11-30T05:54:05.000Z (about 3 years ago)
• Last Synced: 2025-01-25T08:47:29.186Z (10 months ago)
• Topics: algorithm, astar-algorithm, pygame-games, python-3
• Language: Python
• Homepage:
• Size: 13.7 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# A-Star-Path-Find-Algo-Python

#### In this project, *pygame*, *math*,  *PriorityQueue*   used for establishing the A* algorithm.

## What is the A* algorithm?

#### A* is a graph traversal and path search algorithm, which is often used in many fields of computer science due to its completeness, optimality, and optimal efficiency. 

 

## Setup

- Install require packages `pip install -r requirements.txt`

- Run  `python main.py`

## Output

![astar](https://user-images.githubusercontent.com/64283478/204718232-23bb2e7b-6a67-4591-b925-534044aa2c23.gif)

## In A* algorithm, How to use - there are such steps :

- 1.Click any box for *start* position

- 2.Click any box for *end* position

- 3.Now, *left click and drag the mouse cursor* to draw the black border

- 4.Press the *SPACE* button and wait until the endpoint reach.