public void PriorotyQueue_ToStringSingleNodePQ() { MaxHeapPriorityQueue pq = new MaxHeapPriorityQueue(); pq.Enqueue(0, 0); Assert.AreEqual("0:0", pq.ToString()); }
public void PriorotyQueue_ToStringFourNodesPQ() { MaxHeapPriorityQueue pq = new MaxHeapPriorityQueue(); pq.Enqueue(0, 0); pq.Enqueue(10, 0); pq.Enqueue(20, 0); pq.Enqueue(30, 0); Assert.AreEqual("30:0, 20:0, 10:0, 0:0", pq.ToString()); }
public void PriorotyQueue_MethodsExist() { MaxHeapPriorityQueue pq = new MaxHeapPriorityQueue(); pq.Enqueue(10, 1); pq.Dequeue(); pq.Peek(); pq.ToSortedArray(); pq.ToString(); int num = pq.Count; Assert.IsNotNull(pq); }
public void PriorotyQueue_DequeueFullTreeToEmpty() { MaxHeapPriorityQueue pq = new MaxHeapPriorityQueue(); for (int i = 0; i < 13; i++) { pq.Enqueue(i * 10, i); } for (int i = 0; i < 16; i++) { pq.Dequeue(); } Assert.AreEqual(0, pq.Count); Assert.AreEqual("", pq.ToString()); }
public void DequeueFullTreeToEmpty() { MaxHeapPriorityQueue pq = CreateThirteenNodePQDescending(); for (int i = 0; i < 13; i++) { pq.Dequeue(); } int expectedCount = 0; int actualCount = pq.Count; string expectedString = ""; string actualString = pq.ToString(); Assert.AreEqual(expectedCount, actualCount); Assert.AreEqual(expectedString, actualString); }