Metadata-Version: 2.1
Name: prioQbyrobi
Version: 2.0.6
Summary: A package for priority queue to make A* Search
Home-page: https://github.com/Mrrobi/prioQ
Author: Md Robiuddin
Author-email: mrrobi040@gmail.com
License: UNKNOWN
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](https://github.com/Mrrobi/prioQ)
        
        ## using process
        ### First need to add the library
        
        ```python
        pip install prioQbyrobi
        ```
        
        ### Then you need to import the A* Search specific queue from the library
        ```python
        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
        
        
Platform: UNKNOWN
Classifier: Programming Language :: Python :: 3
Classifier: License :: OSI Approved :: MIT License
Classifier: Operating System :: OS Independent
Requires-Python: >=3.6
Description-Content-Type: text/markdown
