Package | Description |
---|---|
org.jgrapht.alg.shortestpath |
Shortest-path related algorithms.
|
org.jgrapht.alg.util |
Utilities used by JGraphT algorithms.
|
org.jgrapht.generate |
Generators for graphs of various topologies.
|
org.jgrapht.graph |
Implementations of various graphs.
|
Constructor and Description |
---|
JohnsonShortestPaths(Graph<V,E> graph,
VertexFactory<V> vertexFactory)
Construct a new instance.
|
JohnsonShortestPaths(Graph<V,E> graph,
VertexFactory<V> vertexFactory,
double epsilon)
Construct a new instance.
|
Modifier and Type | Class and Description |
---|---|
class |
IntegerVertexFactory
Default implementation of a vertex factory which creates integers.
|
Modifier and Type | Method and Description |
---|---|
void |
GeneralizedPetersenGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,List<V>> resultMap)
Generates the Generalized Petersen Graph
|
void |
WeightedGraphGeneratorAdapter.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,T> resultMap)
Deprecated.
Generate a graph structure.
|
void |
GraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,T> resultMap)
Generate a graph structure.
|
void |
WindmillGraphsGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap) |
void |
WheelGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generate a graph structure.
|
void |
WattsStrogatzGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generates a small-world graph based on the Watts-Strogatz model.
|
void |
StarGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generates a star graph with the designated order from the constructor
|
void |
SimpleWeightedGraphMatrixGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap) |
void |
SimpleWeightedBipartiteGraphMatrixGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generate a graph structure.
|
void |
ScaleFreeGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generates scale-free network with size passed to the constructor.
|
void |
RingGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generate a graph structure.
|
void |
LinearizedChordDiagramGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generates an instance.
|
void |
LinearGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generate a graph structure.
|
void |
KleinbergSmallWorldGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generates a small-world graph.
|
void |
HyperCubeGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
This will generate the hypercube graph
|
void |
GridGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generate a graph structure.
|
void |
GnpRandomGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generates a random graph based on the G(n, p) model.
|
void |
GnpRandomBipartiteGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generates a random bipartite graph.
|
void |
GnmRandomGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generates a random graph based on the G(n, M) model
|
void |
GnmRandomBipartiteGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generates a random bipartite graph.
|
void |
EmptyGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generate a graph structure.
|
void |
CompleteGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generate a graph structure.
|
void |
CompleteBipartiteGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Construct a complete bipartite graph
|
void |
ComplementGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap) |
void |
BarabasiAlbertGraphGenerator.generateGraph(Graph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Generates an instance.
|
abstract void |
WeightedGraphGeneratorAdapter.generateGraph(WeightedGraph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,T> resultMap)
Deprecated.
Not needed since
WeightedGraph is deprecated. |
void |
SimpleWeightedGraphMatrixGenerator.generateGraph(WeightedGraph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Deprecated.
Not needed since
WeightedGraph is deprecated. |
void |
SimpleWeightedBipartiteGraphMatrixGenerator.generateGraph(WeightedGraph<V,E> target,
VertexFactory<V> vertexFactory,
Map<String,V> resultMap)
Deprecated.
Not needed since
WeightedGraph is deprecated. |
Constructor and Description |
---|
NamedGraphGenerator(VertexFactory<V> vertexFactory)
Constructs a new generator for named graphs
|
Modifier and Type | Class and Description |
---|---|
class |
ClassBasedVertexFactory<V>
A
VertexFactory for producing vertices by using a class as a factory. |
Copyright © 2017. All rights reserved.