public T RemoveHighest() { // remove object with highest priority NeighborEntry <T> p = this.m_Queue.Dequeue(); return((p == null) ? null : p.Data); }
public int CompareTo(NeighborEntry <T> t) { //note that the positions are reversed! return(t.value.CompareTo(this.value)); }