Uses of Package
com.jgalgo.gen

Packages that use com.jgalgo.gen

Package	Description
com.jgalgo.gen	Graph generators used to generate (possibly random) graphs with different distributions and structures.

Classes in com.jgalgo.gen used by com.jgalgo.gen

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