Uses of Interface
com.jgalgo.gen.GraphGenerator

Packages that use GraphGenerator

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

Uses of GraphGenerator in com.jgalgo.gen

Classes in com.jgalgo.gen that implement GraphGenerator

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