| radwin.org -> Michael J. Radwin -> Projects -> Java Heap | Search |
An array-based implementation of a priority queue, using a Vector to do all of the dirty work. The HeapDescending class is probably what you're interested in -- it was implemented from the pseudocode in Cormen, Leiserson and Rivest.