Uses of Interface
org.jgrapht.generate.GraphGenerator
| Package | Description |
|---|---|
| org.jgrapht.generate |
Generators for graphs of various topologies.
|
-
Uses of GraphGenerator in org.jgrapht.generate
Classes in org.jgrapht.generate that implement GraphGenerator Modifier and Type Class Description classBarabasiAlbertForestGenerator<V,E>Barabási-Albert growth and preferential attachment forest generator.classBarabasiAlbertGraphGenerator<V,E>Barabási-Albert growth and preferential attachment graph generator.classComplementGraphGenerator<V,E>Generator which produces the complement graph of a given input graph.classCompleteBipartiteGraphGenerator<V,E>Generates a complete bipartite graph of any size.classCompleteGraphGenerator<V,E>Generates a complete graph of any size.classDirectedScaleFreeGraphGenerator<V,E>A generator for directed scale-free graphs.classEmptyGraphGenerator<V,E>Generates an empty graph of any size.classGeneralizedPetersenGraphGenerator<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}$.classGnmRandomBipartiteGraphGenerator<V,E>Create a random bipartite graph based on the $G(n, M)$ Erdős–Rényi model.classGnmRandomGraphGenerator<V,E>Create a random graph based on the $G(n, M)$ Erdős–Rényi model.classGnpRandomBipartiteGraphGenerator<V,E>Create a random bipartite graph based on the $G(n, p)$ Erdős–Rényi model.classGnpRandomGraphGenerator<V,E>Create a random graph based on the $G(n, p)$ Erdős–Rényi model.classGridGraphGenerator<V,E>Generates a bidirectional grid graph of any size.classHyperCubeGraphGenerator<V,E>Generates a hyper cube graph of any size.classKleinbergSmallWorldGraphGenerator<V,E>Kleinberg's small-world graph generator.classLinearGraphGenerator<V,E>Generates a linear graph of any size.classLinearizedChordDiagramGraphGenerator<V,E>The linearized chord diagram graph model generator.classPlantedPartitionGraphGenerator<V,E>Create a random $l$-planted partition graph.classPruferTreeGenerator<V,E>Generates a random tree using Prüfer sequences.classRandomRegularGraphGenerator<V,E>Generate a random $d$-regular undirected graph with $n$ vertices.classRingGraphGenerator<V,E>Generates a ring graph of any size.classScaleFreeGraphGenerator<V,E>Generates directed or undirected scale-free network of any size.classSimpleWeightedBipartiteGraphMatrixGenerator<V,E>A simple weighted bipartite graph matrix generator.classSimpleWeightedGraphMatrixGenerator<V,E>A simple weighted graph matrix generator.classStarGraphGenerator<V,E>Generates a star graph of any size.classWattsStrogatzGraphGenerator<V,E>Watts-Strogatz small-world graph generator.classWheelGraphGenerator<V,E>Generates a wheel graph of any size.classWindmillGraphsGenerator<V,E>