Modifier and Type | Method and Description |
---|---|
Graph |
GraphBuilder.getGraph()
Returns the graph being built.
|
Graph |
GraphGenerator.getGraph()
Returns the graph being generated.
|
Modifier and Type | Method and Description |
---|---|
void |
GraphBuilder.importGraph(Graph g)
Constructs a graph builder from a pre built graph.
|
Modifier and Type | Method and Description |
---|---|
protected Graph |
BasicGraphBuilder.buildGraph()
Creates the underlying graph object.
|
protected Graph |
BasicDirectedGraphBuilder.buildGraph()
Creates a directed graph object.
|
Graph |
BasicGraphGenerator.getGraph() |
Graph |
BasicGraphBuilder.getGraph() |
Modifier and Type | Method and Description |
---|---|
void |
BasicGraphBuilder.importGraph(Graph g) |
Modifier and Type | Method and Description |
---|---|
Graph |
FeatureGraphGenerator.getGraph() |
Modifier and Type | Method and Description |
---|---|
Graph |
BasicLineGraphGenerator.getGraph() |
Graph |
OptLineGraphGenerator.getGraph() |
Modifier and Type | Method and Description |
---|---|
Graph |
PolygonGraphGenerator.getGraph() |
Modifier and Type | Method and Description |
---|---|
Graph |
GraphReaderWriter.read()
Creates a Graph from some permanent representation.
|
Modifier and Type | Method and Description |
---|---|
void |
GraphReaderWriter.write(Graph g)
Writes the graph to a permanent representation.
|
Modifier and Type | Method and Description |
---|---|
Graph |
DBReaderWriter.read()
Performs a graph read by querying the database and processing each tuple returned in the
query.
|
Graph |
TextfileReaderWriter.read()
Performs a read of the text file line by line.
|
Graph |
SerializedReaderWriter.read()
Deserializes the graph and reconstructs the original structure.
|
Modifier and Type | Method and Description |
---|---|
void |
DBReaderWriter.write(Graph g)
Performs a write on the graph out to the database.
|
void |
TextfileReaderWriter.write(Graph g)
Performs a write on the graph out to a text file.
|
void |
SerializedReaderWriter.write(Graph graph)
Serializes the graph by writing each edge in the graph to an object output stream.
|
Constructor and Description |
---|
AStarShortestPathFinder(Graph graph,
Node source,
Node target,
AStarIterator.AStarFunctions afuncs)
Constructs a new path finder
|
DijkstraShortestPathFinder(Graph graph,
DijkstraIterator iterator)
Constructs a new path finder.
|
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.
|
Modifier and Type | Interface and Description |
---|---|
interface |
DirectedGraph
Represents a directed graph.
|
Modifier and Type | Class and Description |
---|---|
class |
BasicDirectedGraph
Basic implementation of DirectedGraph.
|
class |
BasicGraph
Basic implemenation of Graph.
|
Modifier and Type | Method and Description |
---|---|
Graph |
GraphTraversal.getGraph()
Returns the graph being traversed.
|
Modifier and Type | Method and Description |
---|---|
void |
GraphIterator.init(Graph graph,
GraphTraversal traversal)
Signals to the itereator that iteration is about to begin.
|
void |
GraphTraversal.setGraph(Graph graph)
Sets the graph being traversed.
|
Modifier and Type | Method and Description |
---|---|
Graph |
BasicGraphTraversal.getGraph() |
Graph |
AbstractGraphIterator.getGraph()
Returns the graph being traversed.
|
Modifier and Type | Method and Description |
---|---|
void |
BasicGraphTraversal.setGraph(Graph graph) |
Constructor and Description |
---|
BasicGraphTraversal(Graph graph,
GraphWalker walker,
GraphIterator iterator)
Constructs a new graph traversal.
|
StagedGraphTraversal(Graph graph,
GraphWalker walker,
GraphIterator iterator) |
Modifier and Type | Method and Description |
---|---|
protected Queue<Graphable> |
BreadthFirstIterator.buildQueue(Graph graph)
Builds the node queue for the iteration.
|
protected Queue<Graphable> |
DepthFirstIterator.buildQueue(Graph graph)
Builds the node queue for the Iteration.
|
protected Queue<Graphable> |
DirectedDepthFirstTopologicalIterator.buildQueue(Graph graph) |
protected Queue<Graphable> |
BreadthFirstTopologicalIterator.buildQueue(Graph graph)
Builds the active node queue.
|
protected Queue<Graphable> |
DepthFirstTopologicalIterator.buildQueue(Graph graph)
Builds the active node queue.
|
protected Queue<Graphable> |
DirectedBreadthFirstTopologicalIterator.buildQueue(Graph graph) |
void |
BreadthFirstIterator.init(Graph graph,
GraphTraversal traversal)
Does nothing.
|
void |
AStarIterator.init(Graph graph,
GraphTraversal traversal)
Does Nothing.
|
void |
NoBifurcationIterator.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) |
Modifier and Type | Method and Description |
---|---|
static Graph |
PoissonClusterer.findClusters(Graph incoming,
Expression base,
Expression target,
double meanRate,
int distance) |
Graph |
DelaunayTriangulator.getTriangulation() |
static Graph |
AutoClust.runAutoClust(Graph d) |
Graph |
DelaunayTriangulator.triangleListToGraph(List<Triangle> tList) |
Modifier and Type | Method and Description |
---|---|
static List<Graph> |
AutoClustUtils.findConnectedComponents(Collection<Node> nodes,
Collection<Edge> edges) |
Modifier and Type | Method and Description |
---|---|
static Graph |
PoissonClusterer.findClusters(Graph incoming,
Expression base,
Expression target,
double meanRate,
int distance) |
static Graph |
AutoClust.runAutoClust(Graph d) |
void |
GraphViewer.setGraph(Graph gr) |
Constructor and Description |
---|
CycleDetector(Graph graph)
Constructs a new CycleDetector.
|
DirectedCycleDetector(Graph graph) |
GraphFuser(Graph graph,
GraphBuilder builder,
GraphFuser.EdgeMerger merger)
Constructs a GraphFuser.
|
GraphPartitioner(Graph graph)
Constructs a new partitioner for a graph.
|
Copyright © 1996–2023 Geotools. All rights reserved.