https://github.com/poltanek/pathfinding_algorithm

This repository contains an implementation of the A* Pathfinding Algorithm, a widely-used search algorithm for finding the shortest path in a grid or maze. The project is optimized for performance using a priority queue and a heuristic function for efficient navigation.
https://github.com/poltanek/pathfinding_algorithm

Last synced: 19 days ago
JSON representation

This repository contains an implementation of the A* Pathfinding Algorithm, a widely-used search algorithm for finding the shortest path in a grid or maze. The project is optimized for performance using a priority queue and a heuristic function for efficient navigation.

• Host: GitHub
• URL: https://github.com/poltanek/pathfinding_algorithm
• Owner: Poltanek
• License: mit
• Created: 2024-11-20T12:50:17.000Z (2 months ago)
• Default Branch: main
• Last Pushed: 2024-11-23T03:19:16.000Z (2 months ago)
• Last Synced: 2024-11-23T03:25:33.211Z (2 months ago)
• Language: Jupyter Notebook
• Homepage:
• Size: 6.84 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# A* Pathfinding Algorithm 

This repository contains an implementation of the A* Pathfinding Algorithm, a widely-used search algorithm for finding the shortest path in a grid or maze. The project is optimized for performance using a priority queue and a heuristic function for efficient navigation.

## Features 

Optimized Performance:

- Time Complexity: O(E + V log V) using a Min-Heap (priority queue).

- Handles large grids efficiently with minimal redundant computations.

Customizable Heuristics:

- Supports Euclidean and Manhattan distance for flexible use cases.

Applications:

- Robotics navigation, game development, and AI systems.

## Under Construction!

Will be implementing more features to this application or is still under planning and development