A package for priority queue to make A* Search
Project description
Priority Queue For A* Search
Anyone of you can use this package to handle the priority Queue part of your A* Search code. Github Open Source
using process
First need to add the library
pip install prioQbyrobi
Then you need to import the A* Search specific queue from the libray
from prioQbyrobi import astar 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
N.B: You must need to declare a variable name "total_cost" the priority is prioritized based on this
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
prioQbyrobi-2.0.5.tar.gz
(1.8 kB
view hashes)
Built Distribution
Close
Hashes for prioQbyrobi-2.0.5-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 6298b75f2ecd68ff8a3fde596f7f6e428d36a81f2e0a3ece038a8b09cd2d10fb |
|
MD5 | 6a0f401b8f7606cbce052cb9f6c6bbb7 |
|
BLAKE2b-256 | 2fcb6e253ada50fa825d4b1e44abf7a0a44d1002dfe10135468afbea9033eb5d |