Package com.jgalgo.gen

package com.jgalgo.gen

Graph generators used to generate (possibly random) graphs with different distributions and structures.

Graph generators are essential for proper testing/benchmarking of algorithms. They can be used to generate with different distributions and structures. A generator may be used to generate only trees, only bipartite graphs, dense or sparse graphs, etc. It is not a trivial task to generate a graph with real world properties, and therefore multiple generators exists, each with different properties.

Related Packages

Package	Description
com.jgalgo	Parent package for all modules of the JGAlgo library.
com.jgalgo.example	Simple examples using the basics of com.jgalgo.graph and invalid reference com.jgalgo.alg .
com.jgalgo.graph	Graphs object are the fundamental building blocks of the JGAlgo library.
com.jgalgo.io	The I/O classes provide varies ways to read/write graphs from/to files.

Class	Description
BarabasiAlbertGraphGenerator<V,E>	Generates a Barabási–Albert graph.
ComplementGraphGenerator<V,E>	Generates the complement graph of a given graph.
CompleteBipartiteGraphGenerator<V,E>	Generates a complete bipartite graph.
CompleteGraphGenerator<V,E>	Generates a complete graph.
DifferenceGraphGenerator<V,E>	Generate a graph that contains the edges that exist in one graph but not in the other.
EmptyGraphGenerator<V,E>	Generate a graph with no edges.
GnmBipartiteGraphGenerator<V,E>	Generates a uniformly random bipartite graph among all graphs with \(n\) vertices and \(m\) edges.
GnmGraphGenerator<V,E>	Generates a uniformly random graph among all graphs with \(n\) vertices and \(m\) edges.
GnpBipartiteGraphGenerator<V,E>	Generates a random bipartite graph using the \(G(n_1,n_2,p)\) model in which every edge exists with probability \(p\).
GnpGraphGenerator<V,E>	Generates a random graph using the \(G(n,p)\) model in which every edge exists with probability \(p\).
GraphGenerator<V,E>	A generator of graphs.
IntersectionGraphGenerator<V,E>	Generate the intersection graph of two or more given graphs.
LineGraphGenerator<V,E>	Generates the line graph given an existing graph.
RecursiveMatrixGraphGenerator<V,E>	Generates a random graph using the R-MAT model.
SymmetricDifferenceGraphGenerator<V,E>	Generate a graph that contains the edges that exist in one of two input graphs but not in both.
UniformTreeGenerator<V,E>	Generate a uniform random tree.
UnionGraphGenerator<V,E>	Generate the union graph of two or more given graphs.