|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
A - the node typeprotected static interface AbstractBaseGraphIterator.NodeQueue<A>
Interface representing a node queue.
| Method Summary | |
|---|---|
void |
add(A node,
double cost)
Adds the given node to this queue. |
boolean |
isEmpty()
|
A |
remove()
Removes the first node in the queue. |
void |
update(A node,
double cost)
Updates the cost of the given node. |
| Method Detail |
|---|
boolean isEmpty()
true if this queue is empty, false otherwise.
void add(A node,
double cost)
node - the node to addcost - the cost for the given node
void update(A node,
double cost)
node - the node to updatecost - the new costA remove()
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||