Package org.jgrapht.generate
Generators for graphs of various topologies.
-
Interface Summary Interface Description GraphGenerator<V,E,T> An interface for generating new graph structures. -
Class Summary Class Description BarabasiAlbertForestGenerator<V,E> Barabási-Albert growth and preferential attachment forest generator.BarabasiAlbertGraphGenerator<V,E> Barabási-Albert growth and preferential attachment graph generator.ComplementGraphGenerator<V,E> Generator which produces the complement graph of a given input graph.CompleteBipartiteGraphGenerator<V,E> Generates a complete bipartite graph of any size.CompleteGraphGenerator<V,E> Generates a complete graph of any size.DirectedScaleFreeGraphGenerator<V,E> A generator for directed scale-free graphs.EmptyGraphGenerator<V,E> Generates an empty graph of any size.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}$.GnmRandomBipartiteGraphGenerator<V,E> Create a random bipartite graph based on the $G(n, M)$ Erdős–Rényi model.GnmRandomGraphGenerator<V,E> Create a random graph based on the $G(n, M)$ Erdős–Rényi model.GnpRandomBipartiteGraphGenerator<V,E> Create a random bipartite graph based on the $G(n, p)$ Erdős–Rényi model.GnpRandomGraphGenerator<V,E> Create a random graph based on the $G(n, p)$ Erdős–Rényi model.GridGraphGenerator<V,E> Generates a bidirectional grid graph of any size.HyperCubeGraphGenerator<V,E> Generates a hyper cube graph of any size.KleinbergSmallWorldGraphGenerator<V,E> Kleinberg's small-world graph generator.LinearGraphGenerator<V,E> Generates a linear graph of any size.LinearizedChordDiagramGraphGenerator<V,E> The linearized chord diagram graph model generator.NamedGraphGenerator<V,E> Collection of commonly used named graphsPlantedPartitionGraphGenerator<V,E> Create a random $l$-planted partition graph.PruferTreeGenerator<V,E> Generates a random tree using Prüfer sequences.RandomRegularGraphGenerator<V,E> Generate a random $d$-regular undirected graph with $n$ vertices.RingGraphGenerator<V,E> Generates a ring graph of any size.ScaleFreeGraphGenerator<V,E> Generates directed or undirected scale-free network of any size.SimpleWeightedBipartiteGraphMatrixGenerator<V,E> A simple weighted bipartite graph matrix generator.SimpleWeightedGraphMatrixGenerator<V,E> A simple weighted graph matrix generator.StarGraphGenerator<V,E> Generates a star graph of any size.WattsStrogatzGraphGenerator<V,E> Watts-Strogatz small-world graph generator.WheelGraphGenerator<V,E> Generates a wheel graph of any size.WindmillGraphsGenerator<V,E> -
Enum Summary Enum Description WindmillGraphsGenerator.Mode WINDMILL and DUTCHWINDMILL Modes for the Constructor -
Exception Summary Exception Description TooManyFailuresException Raised when the generator fails, too many times in a row, to grow a graph.