Search Java Classes and Packages

Search Java Frameworks and Libraries

255581 classes and counting ...
Search Tips Index Status



#Org.geotools.graph.traverse Classes and Interfaces - 27 results found.
NameDescriptionTypePackageFramework
AbstractGraphIteratorAn abstract implementation of GraphIterator.Classorg.geotools.graph.traverse.basicGeoTools
AStarIteratorA path iterator that uses a function (usually denoted f(x)) to determine the order in which the algorithm visits nodes, f(x) is a sum of two functions: Classorg.geotools.graph.traverse.standardGeoTools
AStarIterator .AStarFunctionsDefines the functions needed by A Star.Classorg.geotools.graph.traverse.standard.AStarIteratorGeoTools
AStarIterator .AStarNodeInternal data structure used to track node costs, and parent nodes.Classorg.geotools.graph.traverse.standard.AStarIteratorGeoTools
BasicGraphTraversalA basic implementation of GraphTraversal.Classorg.geotools.graph.traverse.basicGeoTools
BreadthFirstIteratorIterates over the nodes of a graph in a Breadth First Search pattern starting from a specified node.Classorg.geotools.graph.traverse.standardGeoTools
BreadthFirstTopologicalIteratorIterates over the nodes of a graph in Breadth First Topological Sort pattern.Classorg.geotools.graph.traverse.standardGeoTools
CountingWalkerAn implementation of GraphWalker that counts the number of components visited.Classorg.geotools.graph.traverse.basicGeoTools
DepthFirstIteratorIterates over the nodes of a graph in a Depth First Search pattern starting from a specified node.Classorg.geotools.graph.traverse.standardGeoTools
DepthFirstTopologicalIteratorIterates over the nodes of a graph in Depth First Topological Sort pattern.Classorg.geotools.graph.traverse.standardGeoTools
DijkstraIteratorIterates over the nodes of a graph in pattern using Dijkstra's Shortest Path Algorithm.Classorg.geotools.graph.traverse.standardGeoTools
DijkstraIterator .DijkstraNodeInternal data structure used to track node costs, and parent nodes.Classorg.geotools.graph.traverse.standard.DijkstraIteratorGeoTools
DijkstraIterator .EdgeWeighterSupplies a weight for each edge in the graph to be used by the iteration when calculating node costs.Interfaceorg.geotools.graph.traverse.standard.DijkstraIteratorGeoTools
DijkstraIterator .NodeWeighterSupplies a weight for each pair of adjacent edges.Interfaceorg.geotools.graph.traverse.standard.DijkstraIteratorGeoTools
DirectedBreadthFirstIteratorClassorg.geotools.graph.traverse.standardGeoTools
DirectedBreadthFirstTopologicalIteratorClassorg.geotools.graph.traverse.standardGeoTools
DirectedDepthFirstIteratorClassorg.geotools.graph.traverse.standardGeoTools
DirectedDepthFirstTopologicalIteratorClassorg.geotools.graph.traverse.standardGeoTools
DirectedDijkstraIteratorClassorg.geotools.graph.traverse.standardGeoTools
DummyGraphWalkerA simple implementation of GraphWalker that does nothing but signal a graph traversal to continue.Classorg.geotools.graph.traverse.basicGeoTools
GraphIteratorDefines an algorithm in which to traverse the components of a graph.Interfaceorg.geotools.graph.traverseGeoTools
GraphTraversalIterates a GraphWalker over the components of a Graph.Interfaceorg.geotools.graph.traverseGeoTools
GraphWalkerIterated over the components of a graph using a standard visitor Author:Justin Deoliveira, Refractions Research Inc, jdeolive@refractions.Interfaceorg.geotools.graph.traverseGeoTools
NoBifurcationIteratorIterates over the nodes of a graph starting from a specified node, stopping at a bifurcation.Classorg.geotools.graph.traverse.standardGeoTools
SimpleGraphWalkerA simple implementation of GraphWalker that decorates a GraphVisitor.Classorg.geotools.graph.traverse.basicGeoTools
SourceGraphIteratorA GraphIterator that starts iteration from a specefied point.Classorg.geotools.graph.traverse.basicGeoTools
StagedGraphTraversalClassorg.geotools.graph.traverse.basicGeoTools