Uses of Interface
org.geotools.graph.structure.Graphable
-
-
Uses of Graphable in org.geotools.graph.build
Methods in org.geotools.graph.build that return Graphable Modifier and Type Method Description Graphable
GraphGenerator. add(Object obj)
Adds an object to the graph.Graphable
GraphGenerator. get(Object obj)
Retrieves a component of the graph.Graphable
GraphGenerator. remove(Object obj)
Removes an object from the graph. -
Uses of Graphable in org.geotools.graph.build.basic
Methods in org.geotools.graph.build.basic that return Graphable Modifier and Type Method Description Graphable
BasicGraphGenerator. add(Object obj)
Graphable
BasicGraphGenerator. get(Object obj)
Graphable
BasicGraphGenerator. remove(Object obj)
-
Uses of Graphable in org.geotools.graph.build.feature
Methods in org.geotools.graph.build.feature that return Graphable Modifier and Type Method Description Graphable
FeatureGraphGenerator. add(Object obj)
Graphable
FeatureGraphGenerator. get(Object obj)
Graphable
FeatureGraphGenerator. remove(Object obj)
-
Uses of Graphable in org.geotools.graph.build.line
Methods in org.geotools.graph.build.line that return Graphable Modifier and Type Method Description Graphable
BasicLineGraphGenerator. add(Object obj)
Adds a line to the graph.Graphable
LineStringGraphGenerator. add(Object obj)
Graphable
OptDirectedLineGraphGenerator. add(Object obj)
Adds a line to the graph.Graphable
OptLineGraphGenerator. add(Object obj)
Adds a line to the graph.Graphable
BasicLineGraphGenerator. get(Object obj)
Returns the edge which represents a line.Graphable
LineStringGraphGenerator. get(Object obj)
Graphable
OptLineGraphGenerator. get(Object obj)
Returns the edge which represents a line.Graphable
BasicLineGraphGenerator. remove(Object obj)
Removes the edge from the graph that represents a line.Graphable
LineStringGraphGenerator. remove(Object obj)
Graphable
OptLineGraphGenerator. remove(Object obj)
Unsupported operation. -
Uses of Graphable in org.geotools.graph.build.polygon
Methods in org.geotools.graph.build.polygon that return Graphable Modifier and Type Method Description Graphable
PolygonGraphGenerator. add(Object obj)
Graphable
PolygonGraphGenerator. get(Object obj)
Graphable
PolygonGraphGenerator. remove(Object obj)
-
Uses of Graphable in org.geotools.graph.path
Methods in org.geotools.graph.path with parameters of type Graphable Modifier and Type Method Description double
DijkstraShortestPathFinder. getCost(Graphable g)
Returns the cost associated with a node calculated during the graph traversal.Path
DijkstraShortestPathFinder. getPath(Graphable g)
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 Graphable Constructor Description DijkstraShortestPathFinder(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.structure Modifier and Type Interface Description interface
DirectedEdge
Represents an edge in a directed graph.interface
DirectedGraphable
Reperesents a component in a directed graph.interface
DirectedNode
Represents a node in a directed graph.interface
Edge
Represents an edge in Graph.interface
Node
Represents a node in a graph.Methods in org.geotools.graph.structure that return types with arguments of type Graphable Modifier and Type Method Description Iterator<? extends Graphable>
DirectedGraphable. getInRelated()
Returns other components related through an in relationship.Iterator<? extends Graphable>
DirectedGraphable. getOutRelated()
Returns other components related through an out relationship.Iterator<? extends Graphable>
Graphable. getRelated()
Returns an iterator over any related components.List<? extends Graphable>
Graph. queryEdges(GraphVisitor visitor)
Performs a query against the edges of the graph.Methods in org.geotools.graph.structure with parameters of type Graphable Modifier and Type Method Description int
GraphVisitor. visit(Graphable component)
Presents the visitor with the component to visit. -
Uses of Graphable in org.geotools.graph.structure.basic
Classes in org.geotools.graph.structure.basic that implement Graphable Modifier and Type Class Description class
BasicDirectedEdge
Basic implementation of DirectedEdge.class
BasicDirectedNode
Basic implementation of DirectedNode.class
BasicEdge
Basic implementation of Edge.class
BasicGraphable
Basic implementation of Graphable.class
BasicNode
Basic implementation of Node. -
Uses of Graphable in org.geotools.graph.structure.line
Subinterfaces of Graphable in org.geotools.graph.structure.line Modifier and Type Interface Description interface
XYNode
Represents a node in a line network.Classes in org.geotools.graph.structure.line that implement Graphable Modifier and Type Class Description class
BasicDirectedXYNode
Basic implementation of a directed XYNode extended from BasicDirectedNode.class
BasicXYNode
Basic implementation of XYNode extended from BasicNode.class
OptDirectedXYNode
Optimized implementation of XYNode extended from OptDirectedNode.class
OptXYNode
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 Graphable Modifier and Type Class Description class
OptDirectedEdge
Optimized implementation of DirectedEdge.class
OptDirectedNode
Optimized implementation of DirectedNode.class
OptEdge
Optimized implementation of Edge.class
OptGraphable
Root of class hierarchy for optimized implementation of graph components.class
OptNode
Optimized implementation of Node.Methods in org.geotools.graph.structure.opt that return Graphable Modifier and Type Method Description Graphable
OptDirectedEdge.RelatedIterator. next()
Returns the next related edge.Methods in org.geotools.graph.structure.opt that return types with arguments of type Graphable Modifier and Type Method Description Iterator<? extends Graphable>
OptDirectedEdge. getInRelated()
Iterator<? extends Graphable>
OptDirectedEdge. getOutRelated()
Iterator<? extends Graphable>
OptDirectedEdge. getRelated()
-
Uses of Graphable in org.geotools.graph.traverse
Methods in org.geotools.graph.traverse that return Graphable Modifier and Type Method Description Graphable
GraphIterator. next(GraphTraversal traversal)
Returns the next graph component in the iteration.Methods in org.geotools.graph.traverse with parameters of type Graphable Modifier and Type Method Description void
GraphIterator. cont(Graphable current, GraphTraversal traversal)
Signals to the iterator that iteration should continue from the current component in the traversal.boolean
GraphTraversal. isVisited(Graphable g)
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 Graphable Modifier and Type Method Description Graphable
SourceGraphIterator. getSource()
Returns the source of the iteration.Methods in org.geotools.graph.traverse.basic with parameters of type Graphable Modifier and Type Method Description boolean
BasicGraphTraversal. isVisited(Graphable g)
boolean
StagedGraphTraversal. isVisited(Graphable g)
void
SourceGraphIterator. setSource(Graphable source)
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 Graphable Modifier and Type Field Description protected HashMap<Graphable,DijkstraIterator.DijkstraNode>
DijkstraIterator. nodemap
map of graph node to internal Dijkstra node *Methods in org.geotools.graph.traverse.standard that return Graphable Modifier and Type Method Description Graphable
DijkstraIterator. getParent(Graphable component)
Returns the last node in the known set to update the node.Graphable
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.Graphable
BreadthFirstIterator. next(GraphTraversal traversal)
Returns the next node from the node queue that has not yet been visited.Graphable
BreadthFirstTopologicalIterator. next(GraphTraversal traversal)
Returns the next node in the active node queue.Graphable
DijkstraIterator. next(GraphTraversal traversal)
Returns the next node in the priority queue.Graphable
DirectedBreadthFirstTopologicalIterator. next(GraphTraversal traversal)
Graphable
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 Graphable Modifier and Type Method Description protected Queue<Graphable>
BreadthFirstIterator. buildQueue(Graph graph)
Builds the node queue for the iteration.protected Queue<Graphable>
BreadthFirstTopologicalIterator. buildQueue(Graph graph)
Builds the active node queue.protected Queue<Graphable>
DepthFirstIterator. buildQueue(Graph graph)
Builds the node queue for the Iteration.protected Queue<Graphable>
DepthFirstTopologicalIterator. buildQueue(Graph graph)
Builds the active node queue.protected Queue<Graphable>
DirectedBreadthFirstTopologicalIterator. buildQueue(Graph graph)
protected Queue<Graphable>
DirectedDepthFirstTopologicalIterator. buildQueue(Graph graph)
protected Queue<Graphable>
BreadthFirstIterator. getQueue()
Returns the node queue.protected Iterator<? extends Graphable>
DijkstraIterator. getRelated(Graphable current)
protected Iterator<? extends Graphable>
DirectedDijkstraIterator. getRelated(Graphable current)
Methods in org.geotools.graph.traverse.standard with parameters of type Graphable Modifier and Type Method Description void
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
DijkstraIterator. getCost(Graphable component)
Returns the internal cost of a node which has been calculated by the iterator.Graphable
DijkstraIterator. getParent(Graphable component)
Returns the last node in the known set to update the node.protected Iterator<?>
AStarIterator. getRelated(Graphable current)
protected Iterator<? extends Graphable>
DijkstraIterator. getRelated(Graphable current)
protected Iterator<? extends Graphable>
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
BreadthFirstIterator. setSource(Graphable source)
Sets the source of the traversal and places it in the node queue.void
NoBifurcationIterator. setSource(Graphable source)
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 Modifier and Type Class Description class
DelaunayEdge
class
DelaunayNode
-
Uses of Graphable in org.geotools.graph.util.graph
Methods in org.geotools.graph.util.graph with parameters of type Graphable Modifier and Type Method Description int
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.
-