|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.umass.cs.mallet.base.util.search.MinHeap
Created by IntelliJ IDEA.
User: pereira
Date: Jun 18, 2005
Time: 9:11:24 PM
Binary heap implementation of PriorityQueue
.
Based on algorithm in Corman, Leiserson, Rivest, and Stein (Section 6.5).
Constructor Summary | |
MinHeap()
Create a binary heap with minimum initial capacity. |
|
MinHeap(int capacity)
Create a binary heap with initial capacity capacity . |
Method Summary | |
boolean |
contains(QueueElement e)
Does the queue contain an element? |
void |
decreaseKey(QueueElement e,
double priority)
Lower the priority of queue element e to priorrity . |
QueueElement |
extractMin()
Remove the top element of the queue. |
void |
insert(QueueElement e)
Insert element e into the queue. |
QueueElement |
min()
Return the top element of the queue. |
int |
size()
The current size of the queue. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
public MinHeap(int capacity)
capacity
.
The heap's capacity grows as needed to accomodate insertions.
capacity
- initial capacitypublic MinHeap()
Method Detail |
public int size()
PriorityQueue
size
in interface PriorityQueue
public QueueElement min()
PriorityQueue
min
in interface PriorityQueue
public QueueElement extractMin()
PriorityQueue
extractMin
in interface PriorityQueue
public void decreaseKey(QueueElement e, double priority)
PriorityQueue
e
to priorrity
.
The element's position in the queue is adjusted as needed.
IllegalArgumentException
s are thrown if the element is not in the queue or
if the new priority value is greater than the old value.
decreaseKey
in interface PriorityQueue
e
- the element that has been changedpriority
- the new prioritypublic void insert(QueueElement e)
PriorityQueue
e
into the queue.
insert
in interface PriorityQueue
e
- the element to insertpublic boolean contains(QueueElement e)
PriorityQueue
contains
in interface PriorityQueue
e
- the element
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |