Skip to content

Latest commit

 

History

History
15 lines (10 loc) · 465 Bytes

README.md

File metadata and controls

15 lines (10 loc) · 465 Bytes

Shortpath

Python implementation of the A* algorithm for searching the shortest way between two points on a 2d plane. Probably one of the most inefficient implementations possible, using node objects and dictioaries for storage.

Build Status

Installation

pip install -r requirements.txt

Usage

python shortpath/astar.py

OR

python -m shortpath