Crate orx_priority_queue

Priority queue traits; binary and generalized d-ary heap implementations.

Structs

• DaryHeap
• DaryHeapOfIndices
• DaryHeapWithMap

Traits

• HasIndex
  A struct which provides an index of type usize. Index of the struct can be considered its unchanging id defined its position in a collection.
• PriorityQueue
  A priority queue which allows pushing (N, K)=(node, key) pairs to the collection, and popping the foremost element having the lowest key.
• PriorityQueueDecKey
  A PriorityQueueDecKey is a more advanced PriorityQueue with additional features mainly related to accessing or modifying already pushed nodes such as: