Uses of Interface
org.geotools.graph.traverse.GraphTraversal
Packages that use GraphTraversal
Package
Description
-
Uses of GraphTraversal in org.geotools.graph.path
Methods in org.geotools.graph.path that return GraphTraversalMethods in org.geotools.graph.path with parameters of type GraphTraversalModifier and TypeMethodDescriptionint
AStarShortestPathFinder.visit
(Graphable element, GraphTraversal traversal) int
DijkstraShortestPathFinder.visit
(Graphable element, GraphTraversal traversal) Does nothing except signal the traversal to continue. -
Uses of GraphTraversal in org.geotools.graph.traverse
Methods in org.geotools.graph.traverse that return GraphTraversalModifier and TypeMethodDescriptionGraphIterator.getTraversal()
Returns the traversal for the iterator.Methods in org.geotools.graph.traverse with parameters of type GraphTraversalModifier and TypeMethodDescriptionvoid
GraphIterator.cont
(Graphable current, GraphTraversal traversal) Signals to the iterator that iteration should continue from the current component in the traversal.void
GraphIterator.init
(Graph graph, GraphTraversal traversal) Signals to the itereator that iteration is about to begin.void
GraphIterator.killBranch
(Graphable current, GraphTraversal traversal) Signals the iterator to kill the branch at the current component.GraphIterator.next
(GraphTraversal traversal) Returns the next graph component in the iteration.void
GraphIterator.setTraversal
(GraphTraversal traversal) Sets the traversal for the iterator.int
GraphWalker.visit
(Graphable element, GraphTraversal traversal) Visits a graph component. -
Uses of GraphTraversal in org.geotools.graph.traverse.basic
Classes in org.geotools.graph.traverse.basic that implement GraphTraversalModifier and TypeClassDescriptionclass
A basic implementation of GraphTraversal.class
Methods in org.geotools.graph.traverse.basic that return GraphTraversalMethods in org.geotools.graph.traverse.basic with parameters of type GraphTraversalModifier and TypeMethodDescriptionvoid
AbstractGraphIterator.setTraversal
(GraphTraversal traversal) int
CountingWalker.visit
(Graphable element, GraphTraversal traversal) Sets the count of the component and increments the counter.int
DummyGraphWalker.visit
(Graphable element, GraphTraversal traversal) Returns the continue signal.int
SimpleGraphWalker.visit
(Graphable element, GraphTraversal traversal) Defers to the underlying visitor. -
Uses of GraphTraversal in org.geotools.graph.traverse.standard
Methods in org.geotools.graph.traverse.standard with parameters of type GraphTraversalModifier and TypeMethodDescriptionvoid
AStarIterator.cont
(Graphable current, GraphTraversal traversal) Makes a step of the A* algorithm.void
BreadthFirstIterator.cont
(Graphable current, GraphTraversal traversal) Looks for nodes adjacent to the current node to place into the node queue.void
BreadthFirstTopologicalIterator.cont
(Graphable current, GraphTraversal traversal) Continues the iteration by incrementing the counters of any unvisited nodes related to the current node.void
DijkstraIterator.cont
(Graphable current, GraphTraversal traversal) Looks for adjacent nodes to the current node which are in the adjacent node and updates costs.void
DirectedBreadthFirstIterator.cont
(Graphable current, GraphTraversal traversal) void
DirectedBreadthFirstTopologicalIterator.cont
(Graphable current, GraphTraversal traversal) void
DirectedDepthFirstIterator.cont
(Graphable current, GraphTraversal traversal) void
NoBifurcationIterator.cont
(Graphable current, GraphTraversal traversal) Searches for the next node to be returned in the iteration.void
AStarIterator.init
(Graph graph, GraphTraversal traversal) Does Nothing.void
BreadthFirstIterator.init
(Graph graph, GraphTraversal traversal) Does nothing.void
BreadthFirstTopologicalIterator.init
(Graph graph, GraphTraversal traversal) Creates the active queue, and populates it with all nodes of degree less than 2.void
DijkstraIterator.init
(Graph graph, GraphTraversal traversal) Builds internal priority queue to manage node costs.void
DirectedBreadthFirstTopologicalIterator.init
(Graph graph, GraphTraversal traversal) void
NoBifurcationIterator.init
(Graph graph, GraphTraversal traversal) Does nothing.void
AStarIterator.killBranch
(Graphable current, GraphTraversal traversal) Kills the branch of the traversalvoid
BreadthFirstIterator.killBranch
(Graphable current, GraphTraversal traversal) Kills the current branch by not looking for any adjacent nodes to place into the node queue.void
BreadthFirstTopologicalIterator.killBranch
(Graphable current, GraphTraversal traversal) Kills the current branch of the traversal by not incrementing the counters of any related nodes.void
DijkstraIterator.killBranch
(Graphable current, GraphTraversal traversal) Kills the branch of the traversal by not updating the cost of any adjacent nodes.void
DirectedBreadthFirstTopologicalIterator.killBranch
(Graphable current, GraphTraversal traversal) void
NoBifurcationIterator.killBranch
(Graphable current, GraphTraversal traversal) Kills the current branch of the iteration by explicitly setting the next node to be returned to null.AStarIterator.next
(GraphTraversal traversal) Returns the next node in the priority queue. if the queue is empty then there is no path from the source to the destiny in this graph.BreadthFirstIterator.next
(GraphTraversal traversal) Returns the next node from the node queue that has not yet been visited.BreadthFirstTopologicalIterator.next
(GraphTraversal traversal) Returns the next node in the active node queue.DijkstraIterator.next
(GraphTraversal traversal) Returns the next node in the priority queue.DirectedBreadthFirstTopologicalIterator.next
(GraphTraversal traversal) NoBifurcationIterator.next
(GraphTraversal traversal) The next node in the iteration is the first node found adjacent to the current node that is non visited and of degree less than 2. -
Uses of GraphTraversal in org.geotools.graph.util.graph
Methods in org.geotools.graph.util.graph with parameters of type GraphTraversalModifier and TypeMethodDescriptionint
CycleDetector.visit
(Graphable element, GraphTraversal traversal) Increments the count of nodes visited.int
GraphPartitioner.visit
(Graphable element, GraphTraversal traversal) Adds the element to the current partition.