Package | Description |
---|---|
org.jgrapht.generate |
Generators for graphs of various topologies.
|
Modifier and Type | Class and Description |
---|---|
class |
BarabasiAlbertForestGenerator<V,E>
Barabási-Albert growth and preferential attachment forest generator.
|
class |
BarabasiAlbertGraphGenerator<V,E>
Barabási-Albert growth and preferential attachment graph generator.
|
class |
ComplementGraphGenerator<V,E>
Generator which produces the
complement graph of a given input
graph.
|
class |
CompleteBipartiteGraphGenerator<V,E>
Generates a complete bipartite
graph of any size.
|
class |
CompleteGraphGenerator<V,E>
Generates a complete graph of any size.
|
class |
EmptyGraphGenerator<V,E>
Generates an empty graph of any size.
|
class |
GeneralizedPetersenGraphGenerator<V,E>
Generator for Generalized
Petersen Graphs The Generalized Petersen graphs $GP(n,k)$ are a family of cubic graphs formed
by connecting the vertices of a regular polygon (cycle graph $C_n$) to the corresponding vertices
of a star polygon ${n,k}$.
|
class |
GnmRandomBipartiteGraphGenerator<V,E>
Create a random bipartite graph based on the $G(n, M)$ Erdős–Rényi model.
|
class |
GnmRandomGraphGenerator<V,E>
Create a random graph based on the $G(n, M)$ Erdős–Rényi model.
|
class |
GnpRandomBipartiteGraphGenerator<V,E>
Create a random bipartite graph based on the $G(n, p)$ Erdős–Rényi model.
|
class |
GnpRandomGraphGenerator<V,E>
Create a random graph based on the $G(n, p)$ Erdős–Rényi model.
|
class |
GridGraphGenerator<V,E>
Generates a bidirectional grid graph of
any size.
|
class |
HyperCubeGraphGenerator<V,E>
Generates a hyper cube graph of
any size.
|
class |
KleinbergSmallWorldGraphGenerator<V,E>
Kleinberg's small-world graph generator.
|
class |
LinearGraphGenerator<V,E>
Generates a linear graph of any size.
|
class |
LinearizedChordDiagramGraphGenerator<V,E>
The linearized chord diagram graph model generator.
|
class |
PlantedPartitionGraphGenerator<V,E>
Create a random $l$-planted partition graph.
|
class |
PruferTreeGenerator<V,E>
Generates a random tree using Prüfer sequences.
|
class |
RandomRegularGraphGenerator<V,E>
Generate a random $d$-regular undirected graph with $n$ vertices.
|
class |
RingGraphGenerator<V,E>
Generates a ring graph of any size.
|
class |
ScaleFreeGraphGenerator<V,E>
Generates directed or undirected
scale-free network of any
size.
|
class |
SimpleWeightedBipartiteGraphMatrixGenerator<V,E>
A simple weighted bipartite graph matrix generator.
|
class |
SimpleWeightedGraphMatrixGenerator<V,E>
A simple weighted graph matrix generator.
|
class |
StarGraphGenerator<V,E>
Generates a star graph of any size.
|
class |
WattsStrogatzGraphGenerator<V,E>
Watts-Strogatz small-world graph generator.
|
class |
WheelGraphGenerator<V,E>
Generates a wheel graph of any size.
|
class |
WindmillGraphsGenerator<V,E>
|
Copyright © 2018. All rights reserved.