Description:

prioQbyrobi 2.0.6

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

License

For personal and professional use. You cannot resell or redistribute these repositories in their original state.

Share

• Share on Facebook
• Share on Twitter