|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use QueueElement | |
---|---|
cc.mallet.util.search |
Uses of QueueElement in cc.mallet.util.search |
---|
Classes in cc.mallet.util.search that implement QueueElement | |
---|---|
class |
AStarNode
Created by IntelliJ IDEA. |
class |
SearchNode
Created by IntelliJ IDEA. |
Methods in cc.mallet.util.search that return QueueElement | |
---|---|
QueueElement |
PriorityQueue.extractMin()
Remove the top element of the queue. |
QueueElement |
MinHeap.extractMin()
|
QueueElement |
PriorityQueue.min()
Return the top element of the queue. |
QueueElement |
MinHeap.min()
|
QueueElement[] |
PriorityQueue.toArray()
Returns any array containing all of the elements in the queue. |
QueueElement[] |
MinHeap.toArray()
|
Methods in cc.mallet.util.search with parameters of type QueueElement | |
---|---|
void |
PriorityQueue.changePriority(QueueElement e,
double priority)
Change the priority of queue element e to priority . |
void |
MinHeap.changePriority(QueueElement e,
double priority)
|
boolean |
PriorityQueue.contains(QueueElement e)
Does the queue contain an element? |
boolean |
MinHeap.contains(QueueElement e)
|
void |
PriorityQueue.insert(QueueElement e)
Insert element e into the queue. |
void |
MinHeap.insert(QueueElement e)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |