API reference

HeapPriorityQueue{K,V}

Min priority queue with keys of type K and priority values of type V, stored using a binary heap from DataStructures.jl.

Fields

• heap::BinaryHeap{K,V}: heap of key-value pairs k => v ordered by increasing v

SortedVectorPriorityQueue{K,V}

Min priority queue with keys of type K and priority values of type V, stored using a sorted vector of couples.

Fields

• pairs::Vector{Pair{K,V}}: vector of key-value pairs k => v ordered by increasing v.

VectorPriorityQueue{K,V}

Min priority queue with keys of type K and priority values of type V, stored as a vector of couples.

Fields

• pairs::Vector{Pair{K,V}}: vector of key-value pairs k => v in arbitrary order.

dequeue!(pq::HeapPriorityQueue)

Remove and return the key k with lowest priority value v. Amortized complexity O(1).

dequeue!(pq::SortedVectorPriorityQueue)

Remove and return the key k with lowest priority value v. Amortized complexity O(1).

dequeue!(pq::VectorPriorityQueue)

Remove and return the key k with lowest priority value v. Amortized complexity O(n).

dequeue_pair!(pq::HeapPriorityQueue)

Remove and return the pair k => v with lowest priority value v. Amortized complexity O(1).

dequeue_pair!(pq::SortedVectorPriorityQueue)

Remove and return the pair k => v with lowest priority value v. Amortized complexity O(1).

dequeue_pair!(pq::VectorPriorityQueue)

Remove and return the pair k => v with lowest priority value v. Amortized complexity O(n).

enqueue!(pq::HeapPriorityQueue, k, v)

Insert k => v into the queue pq. Amortized complexity O(log n).

enqueue!(pq::SortedVectorPriorityQueue, k, v)

Insert k => v into the queue pq. Amortized complexity O(log n).

enqueue!(pq::VectorPriorityQueue, k, v)

Insert k => v into the queue pq. Amortized complexity O(1).