|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object | +--drasys.or.cont.BinaryHeap | +--drasys.or.cont.PriorityQueue
An anonymous implementation of a priority queue. This is intended to be a redifinition of the most versatile priority queue implementation in the graph package. This is currently implemented an a BinaryHeap but this could change.
BinaryHeap
,
BinomialHeap
, Serialized FormConstructor Summary | |
PriorityQueue(CompareI compare)
|
|
PriorityQueue(CompareI compare,
int capacity)
|
Methods inherited from class drasys.or.cont.BinaryHeap |
changePriority,
check,
elementAt,
elements,
ensureCapacity,
getHead,
insert,
insert,
popHead,
removeAllElements,
setCompare,
size |
Methods inherited from class java.lang.Object |
clone,
equals,
finalize,
getClass,
hashCode,
notify,
notifyAll,
toString,
wait,
wait,
wait |
Constructor Detail |
public PriorityQueue(CompareI compare)
public PriorityQueue(CompareI compare, int capacity)
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: INNER | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |