Go to the source code of this file.
|class ||Com.Mission_Base.Pbl.PriorityQueue< T >|
| ||PriorityQueue<T> is a C# implementation of a generic priority queue based on a binary min-heap. This C# implementation provides O(log(n)) time for insertion methods; O(log(n)) time for removal methods; and constant time for retrieval methods. The implementation is derived from the List<T> class, therefore most List<T> methods can also be applied to a PriorityQueue<T>, however, List<T> methods that would destroy the heap condition of the priority queue will throw an InvalidOperationException, e.g. Reverse(). More...|