| Package | Description |
|---|---|
| edu.umass.cs.mallet.base.util.search |
| Modifier and Type | Class and Description |
|---|---|
class |
AStarNode
Created by IntelliJ IDEA.
|
class |
SearchNode
Created by IntelliJ IDEA.
|
| Modifier and Type | Method and Description |
|---|---|
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() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
PriorityQueue.contains(QueueElement e)
Does the queue contain an element?
|
boolean |
MinHeap.contains(QueueElement e) |
void |
PriorityQueue.decreaseKey(QueueElement e,
double priority)
Lower the priority of queue element
e to priorrity. |
void |
MinHeap.decreaseKey(QueueElement e,
double priority) |
void |
PriorityQueue.insert(QueueElement e)
Insert element
e into the queue. |
void |
MinHeap.insert(QueueElement e) |
Copyright © 2019 JULIE Lab, Germany. All rights reserved.