You can update an element in the priority queue, thereby reposition it in the queue. Save the PriorityQueueTNode returned by Enqueue(T), and updated the value by setting the Value.
In cases where priority value equals, it does first-in-first-out.
Performance: It has O(log(n)) enqueueing, dequeueing and updating of key.
public class PriorityQueue<T>
[Missing <typeparam name="T"/> documentation for "T:DHI.Mike1D.Generic.PriorityQueue`1"]
| PriorityQueueT | Create a priority queue using the default comparer for the T. |
| PriorityQueueT(IComparerT) | Create a priority queue and use the provided comparer for the keys. |
| Count | Current number of elements in queue |
| First | Take a look at the first element in the queue, without dequeue'ing |
| FirstNode | Take a look at the first element in the queue, without dequeue'ing, returning the priority key node |
| Clear | Clears and empties queue. |
| Dequeue | Take the first element out of the queue and return it. the first element is the one with the largest key. |
| Enqueue | Add a new element to the queue, with the given priority |
| Equals | Determines whether the specified object is equal to the current object. (Inherited from Object) |
| Finalize | Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object) |
| GetHashCode | Serves as the default hash function. (Inherited from Object) |
| GetType | Gets the Type of the current instance. (Inherited from Object) |
| MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object) |
| ToArray |
Copies the elements of the priority queue to a new array,
sorts it and returns it in priority order.
This is an O(n log(n)) operation |
| ToString | Returns a string that represents the current object. (Inherited from Object) |