A package for priority queue to make A* Search
Project description
A* Search Algorithm.
Anyone of you can use this library to do A* search Github Open Source
using process
First need to add the library
pip install astarRobi
Then you need to import the A* Search specific queue from the library
import asterRobi as Q
minQ = Q.PriorityQueue() #Creating an object of PriorityQueue class of the library
minQ.insert(yournodeObj) #inserting your node object into the Queue
minQ.delete() # popping your node object from the priority queue
##Existing methods
- insert() - insert node object.
- delete() - pop min element and return it.
- isEmpty() - return true if queue is empty.
- size() - it returns length of the queue.
N.B: You must need to declare a variable name "total_cost" the priority is prioritized based on this
Project details
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
astarRobi-1.0.2.tar.gz
(2.1 kB
view hashes)
Built Distribution
Close
Hashes for astarRobi-1.0.2-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | fbdcc14bcd37ff920e9ba45601e5d7ab0cb93cb9d0c35153b877bb0c42a5673c |
|
MD5 | 94fcf1d4f2180b3264a0ec3e571e65fc |
|
BLAKE2b-256 | 638340c48bcb20f2835ff4dc39df5ceee6b8ac9dd53232c4596865d01eea411a |