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 library
import prioQbyrobi 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
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.6.tar.gz
(1.9 kB
view hashes)
Built Distribution
Close
Hashes for prioQbyrobi-2.0.6-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 09fabbd92ce13fed6f94288a38d30f2e962c5858b5150cf148deccae3cd26c6c |
|
MD5 | 56bd073a9c867bb8cbeb8e0b39d1f5d3 |
|
BLAKE2b-256 | bf9c246cc65193ab040056f6b913c547f4c1fa7c6a497b0f70d4f8fc1492cbde |