Synopsis A
PriorityQueue datatype and associated functions.
Usage
import util::PriorityQueue;
Description Priority queues maintain (priority, value) pairs in sorted order. They are implemented using a
Binomial Heap
. Priority queue are, for instance, used to implement shortest path algorithms.
Provides the following functions:
. Priority queue are, for instance, used to implement shortest path algorithms.
Provides the following functions:
- extractMinimum: Extract minimum element from priority queue.
- findMinimum: Find the minimum priority in a priority queue.
- insertElement: Insert an element in a priority queue.
- isEmpty: Check whether priority queue is empty.
- mkPriorityQueue: Create a priority queue.
Pitfalls Currently, both priority and associated value ("payload") have to be integers. This will be generalized.