com.kuka.graph.traverse
Class ClosestFirstIterator<N>

java.lang.Object
  com.kuka.graph.traverse.AbstractBaseGraphIterator<ClosestFirstIterator<N>,N>
      com.kuka.graph.traverse.ClosestFirstIterator<N>

Type Parameters:

N - the node type

All Implemented Interfaces:

GraphIterator<ClosestFirstIterator<N>,N>, Iterator<N>

public final class ClosestFirstIterator<N>
extends AbstractBaseGraphIterator<ClosestFirstIterator<N>,N>

A closest first iterator.

Nested Class Summary

Nested classes/interfaces inherited from class com.kuka.graph.traverse.AbstractBaseGraphIterator

AbstractBaseGraphIterator.NodeQueue<A>

Constructor Summary

ClosestFirstIterator(Graph<N,?> graph, CostFunction<N,?> cost, N start)
Creates a new closest first iterator starting at the given node and expanding all nodes of the graph.

ClosestFirstIterator(Graph<N,?> graph, CostFunction<N,?> cost, N start, N goal)
Creates a new closest first iterator starting at the given node and expanding all nodes of the graph until the given goal node is found.

Method Summary

Methods inherited from class com.kuka.graph.traverse.AbstractBaseGraphIterator

getCost, getCost, getPredecessor, getPredecessor, hasNext, next, remove, self, setCost, setEdgeFilter, setNodeFilter

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

ClosestFirstIterator

public ClosestFirstIterator(Graph<N,?> graph,
                            CostFunction<N,?> cost,
                            N start)

Creates a new closest first iterator starting at the given node and expanding all nodes of the graph.

Parameters:

graph - the graph

cost - the cost

start - the start node

ClosestFirstIterator

public ClosestFirstIterator(Graph<N,?> graph,
                            CostFunction<N,?> cost,
                            N start,
                            N goal)

Creates a new closest first iterator starting at the given node and expanding all nodes of the graph until the given goal node is found.

Parameters:

graph - the graph

cost - the cost

start - the start node

goal - the goal node