Example #1
0
        public T RemoveHighest()
        {
            // remove object with highest priority
            NeighborEntry <T> p = this.m_Queue.Dequeue();

            return((p == null) ? null : p.Data);
        }
Example #2
0
 public int CompareTo(NeighborEntry <T> t)
 {
     //note that the positions are reversed!
     return(t.value.CompareTo(this.value));
 }