priority-queue (Scripts) Publisher's description
from Brian SchrГ¶der
An efficent priority queue implementation
An efficent priority queue implementation. A prominent algorithm using a priority queue is dijkstras shortest path algorithm. Efficent means constant time insert, constant amortize decrease_priority and amortized O(log n) delete_min operation.
Program Release Status:
Program Install Support: Install and Uninstall