http://www.csl.mtu.edu/cs2321/www/newLectures/09_Inplace_Heap_Sort.html
Adaptable priority queues support access for quick retrieval and modification of all entries in the priority queue.
http://www.cs.trincoll.edu/~ram/cpsc215/sourcecode/net/datastructures/HeapPriorityQueue.java
Adaptable priority queues support access for quick retrieval and modification of all entries in the priority queue.
Interface AdaptablePriorityQueue extends PriorityQueue {
public Entry remove(Entry e);
/* returns old key */
public Object replace(Entry e, Object key);
/* returns the old value */
public Object replaceValue(Entry e, Object value);
}
http://www.cs.trincoll.edu/~ram/cpsc215/sourcecode/net/datastructures/HeapAdaptablePriorityQueue.javapublic Entry remove(Entry e);
/* returns old key */
public Object replace(Entry e, Object key);
/* returns the old value */
public Object replaceValue(Entry e, Object value);
}
http://www.cs.trincoll.edu/~ram/cpsc215/sourcecode/net/datastructures/HeapPriorityQueue.java
