Uses of Interface
org.geotools.graph.structure.Graphable
Packages that use Graphable
Package
Description
-
Uses of Graphable in org.geotools.graph.build
Methods in org.geotools.graph.build that return Graphable -
Uses of Graphable in org.geotools.graph.build.basic
Methods in org.geotools.graph.build.basic that return Graphable -
Uses of Graphable in org.geotools.graph.build.feature
Methods in org.geotools.graph.build.feature that return Graphable -
Uses of Graphable in org.geotools.graph.build.line
Methods in org.geotools.graph.build.line that return GraphableModifier and TypeMethodDescriptionAdds a line to the graph.Adds a line to the graph.Adds a line to the graph.Returns the edge which represents a line.Returns the edge which represents a line.Removes the edge from the graph that represents a line.Unsupported operation. -
Uses of Graphable in org.geotools.graph.build.polygon
Methods in org.geotools.graph.build.polygon that return Graphable -
Uses of Graphable in org.geotools.graph.path
Methods in org.geotools.graph.path with parameters of type GraphableModifier and TypeMethodDescriptiondouble
Returns the cost associated with a node calculated during the graph traversal.Returns a path from g to the source.int
AStarShortestPathFinder.visit
(Graphable element, GraphTraversal traversal) int
DijkstraShortestPathFinder.visit
(Graphable element, GraphTraversal traversal) Does nothing except signal the traversal to continue.Constructors in org.geotools.graph.path with parameters of type GraphableModifierConstructorDescriptionDijkstraShortestPathFinder
(Graph graph, Graphable source, DijkstraIterator.EdgeWeighter weighter) Constructs a new path finder.DijkstraShortestPathFinder
(Graph graph, Graphable source, DijkstraIterator.EdgeWeighter weighter, DijkstraIterator.NodeWeighter nweighter) Constructs a new path finder. -
Uses of Graphable in org.geotools.graph.structure
Subinterfaces of Graphable in org.geotools.graph.structureModifier and TypeInterfaceDescriptioninterface
Represents an edge in a directed graph.interface
Reperesents a component in a directed graph.interface
Represents a node in a directed graph.interface
Represents an edge in Graph.interface
Represents a node in a graph.Methods in org.geotools.graph.structure that return types with arguments of type GraphableModifier and TypeMethodDescriptionDirectedGraphable.getInRelated()
Returns other components related through an in relationship.DirectedGraphable.getOutRelated()
Returns other components related through an out relationship.Graphable.getRelated()
Returns an iterator over any related components.Graph.queryEdges
(GraphVisitor visitor) Performs a query against the edges of the graph.Methods in org.geotools.graph.structure with parameters of type Graphable -
Uses of Graphable in org.geotools.graph.structure.basic
Classes in org.geotools.graph.structure.basic that implement GraphableModifier and TypeClassDescriptionclass
Basic implementation of DirectedEdge.class
Basic implementation of DirectedNode.class
Basic implementation of Edge.class
Basic implementation of Graphable.class
Basic implementation of Node. -
Uses of Graphable in org.geotools.graph.structure.line
Subinterfaces of Graphable in org.geotools.graph.structure.lineClasses in org.geotools.graph.structure.line that implement GraphableModifier and TypeClassDescriptionclass
Basic implementation of a directed XYNode extended from BasicDirectedNode.class
Basic implementation of XYNode extended from BasicNode.class
Optimized implementation of XYNode extended from OptDirectedNode.class
Optimized implementation of XYNode extended from OptNode. -
Uses of Graphable in org.geotools.graph.structure.opt
Classes in org.geotools.graph.structure.opt that implement GraphableModifier and TypeClassDescriptionclass
Optimized implementation of DirectedEdge.class
Optimized implementation of DirectedNode.class
Optimized implementation of Edge.class
Root of class hierarchy for optimized implementation of graph components.class
Optimized implementation of Node.Methods in org.geotools.graph.structure.opt that return GraphableModifier and TypeMethodDescriptionOptDirectedEdge.RelatedIterator.next()
Returns the next related edge.Methods in org.geotools.graph.structure.opt that return types with arguments of type GraphableModifier and TypeMethodDescriptionOptDirectedEdge.getInRelated()
OptDirectedEdge.getOutRelated()
OptDirectedEdge.getRelated()
-
Uses of Graphable in org.geotools.graph.traverse
Methods in org.geotools.graph.traverse that return GraphableModifier and TypeMethodDescriptionGraphIterator.next
(GraphTraversal traversal) Returns the next graph component in the iteration.Methods in org.geotools.graph.traverse with parameters of type GraphableModifier and TypeMethodDescriptionvoid
GraphIterator.cont
(Graphable current, GraphTraversal traversal) Signals to the iterator that iteration should continue from the current component in the traversal.boolean
void
GraphIterator.killBranch
(Graphable current, GraphTraversal traversal) Signals the iterator to kill the branch at the current component.void
GraphTraversal.setVisited
(Graphable g, boolean visited) int
GraphWalker.visit
(Graphable element, GraphTraversal traversal) Visits a graph component. -
Uses of Graphable in org.geotools.graph.traverse.basic
Methods in org.geotools.graph.traverse.basic that return GraphableModifier and TypeMethodDescriptionSourceGraphIterator.getSource()
Returns the source of the iteration.Methods in org.geotools.graph.traverse.basic with parameters of type GraphableModifier and TypeMethodDescriptionboolean
boolean
void
Sets the source for the iteration.void
BasicGraphTraversal.setVisited
(Graphable g, boolean visited) void
StagedGraphTraversal.setVisited
(Graphable g, boolean visited) 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 Graphable in org.geotools.graph.traverse.standard
Fields in org.geotools.graph.traverse.standard with type parameters of type GraphableModifier and TypeFieldDescriptionprotected HashMap<Graphable,
DijkstraIterator.DijkstraNode> DijkstraIterator.nodemap
map of graph node to internal Dijkstra node *Methods in org.geotools.graph.traverse.standard that return GraphableModifier and TypeMethodDescriptionReturns the last node in the known set to update the node.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.Methods in org.geotools.graph.traverse.standard that return types with arguments of type GraphableModifier and TypeMethodDescriptionBreadthFirstIterator.buildQueue
(Graph graph) Builds the node queue for the iteration.BreadthFirstTopologicalIterator.buildQueue
(Graph graph) Builds the active node queue.DepthFirstIterator.buildQueue
(Graph graph) Builds the node queue for the Iteration.DepthFirstTopologicalIterator.buildQueue
(Graph graph) Builds the active node queue.DirectedBreadthFirstTopologicalIterator.buildQueue
(Graph graph) DirectedDepthFirstTopologicalIterator.buildQueue
(Graph graph) BreadthFirstIterator.getQueue()
Returns the node queue.DijkstraIterator.getRelated
(Graphable current) DirectedDijkstraIterator.getRelated
(Graphable current) Methods in org.geotools.graph.traverse.standard with parameters of type GraphableModifier 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.double
Returns the internal cost of a node which has been calculated by the iterator.Returns the last node in the known set to update the node.protected Iterator<?>
AStarIterator.getRelated
(Graphable current) DijkstraIterator.getRelated
(Graphable current) DirectedDijkstraIterator.getRelated
(Graphable current) 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.void
Sets the source of the traversal and places it in the node queue.void
Sets the source of the traversal. -
Uses of Graphable in org.geotools.graph.util.delaunay
Classes in org.geotools.graph.util.delaunay that implement Graphable -
Uses of Graphable in org.geotools.graph.util.graph
Methods in org.geotools.graph.util.graph with parameters of type GraphableModifier 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.