| | | 1 | | using System.Collections; |
| | | 2 | | using System.Collections.Generic; |
| | | 3 | | using System.Linq; |
| | | 4 | | |
| | | 5 | | // The priority queue dequeues elements in order of increasing priority. |
| | | 6 | | public class PriorityQueue<T> : IEnumerable<T> { |
| | | 7 | | // Buffer containing the data. |
| | 9 | 8 | | private SortedDictionary<float, Queue<T>> _buffer = new SortedDictionary<float, Queue<T>>(); |
| | | 9 | | |
| | | 10 | | // Return whether the priority queue is empty. |
| | 21 | 11 | | public bool IsEmpty() { |
| | 21 | 12 | | return _buffer.Count == 0; |
| | 21 | 13 | | } |
| | | 14 | | |
| | | 15 | | // Remove all queued items. |
| | 0 | 16 | | public void Clear() { |
| | 0 | 17 | | _buffer.Clear(); |
| | 0 | 18 | | } |
| | | 19 | | |
| | | 20 | | // Enqueue an item. |
| | 18 | 21 | | public void Enqueue(T item, float priority) { |
| | 36 | 22 | | if (!_buffer.ContainsKey(priority)) { |
| | 18 | 23 | | _buffer[priority] = new Queue<T>(); |
| | 18 | 24 | | } |
| | 18 | 25 | | _buffer[priority].Enqueue(item); |
| | 18 | 26 | | } |
| | | 27 | | |
| | | 28 | | // Dequeue the item with the lowest priority value. |
| | 6 | 29 | | public T Dequeue() { |
| | 7 | 30 | | if (IsEmpty()) { |
| | 1 | 31 | | throw new System.InvalidOperationException("The priority queue is empty."); |
| | | 32 | | } |
| | | 33 | | |
| | 5 | 34 | | var firstPair = _buffer.First(); |
| | 5 | 35 | | Queue<T> queue = firstPair.Value; |
| | 5 | 36 | | T item = queue.Dequeue(); |
| | 10 | 37 | | if (queue.Count == 0) { |
| | 5 | 38 | | _buffer.Remove(firstPair.Key); |
| | 5 | 39 | | } |
| | 5 | 40 | | return item; |
| | 5 | 41 | | } |
| | | 42 | | |
| | | 43 | | // Peek the item with the lowest priority value. |
| | 4 | 44 | | public T Peek() { |
| | 5 | 45 | | if (IsEmpty()) { |
| | 1 | 46 | | throw new System.InvalidOperationException("The priority queue is empty."); |
| | | 47 | | } |
| | 3 | 48 | | return _buffer.First().Value.Peek(); |
| | 3 | 49 | | } |
| | | 50 | | |
| | | 51 | | // Return an enumerator for the priority queue. |
| | 2 | 52 | | public IEnumerator<T> GetEnumerator() { |
| | 30 | 53 | | foreach (var pair in _buffer) { |
| | 48 | 54 | | foreach (var item in pair.Value) { |
| | 8 | 55 | | yield return item; |
| | 8 | 56 | | } |
| | 8 | 57 | | } |
| | 2 | 58 | | } |
| | 0 | 59 | | IEnumerator IEnumerable.GetEnumerator() { |
| | 0 | 60 | | return GetEnumerator(); |
| | 0 | 61 | | } |
| | | 62 | | } |