|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
T - the iterator typeN - the node typepublic interface GraphIterator<T extends GraphIterator<T,N>,N>
Iterator interface for graph traversal.
| Method Summary | |
|---|---|
double |
getCost()
|
double |
getCost(N node)
Returns the cost of the given node. |
N |
getPredecessor()
Returns the predecessor node of this graph iterator. |
N |
getPredecessor(N node)
Returns the predecessor node of a certain node of this graph iterator. |
T |
setCost(CostFunction<N,?> costFunction)
Sets the cost function used for node expansions. |
T |
setEdgeFilter(GraphElementFilter<Edge<N>> filter)
Sets an edge filter for this node iterator. |
T |
setNodeFilter(GraphElementFilter<N> filter)
Sets a node filter for this node iterator. |
| Methods inherited from interface java.util.Iterator |
|---|
hasNext, next, remove |
| Method Detail |
|---|
T setNodeFilter(GraphElementFilter<N> filter)
filter - the node filter
T setEdgeFilter(GraphElementFilter<Edge<N>> filter)
filter - the edge filter
T setCost(CostFunction<N,?> costFunction)
costFunction - the cost function
N getPredecessor()
N getPredecessor(N node)
node - the node to get predecessor for
double getCost()
double getCost(N node)
node - the node
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||