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.

Interface Summary

Interface	Description
GraphGenerator<V,E>	A generator of graphs.

Class Summary

Class	Description
BarabasiAlbertGraphGenerator<V,E>	Generates a Barabási–Albert graph.
CompleteGraphGenerator<V,E>	Generates a complete graph.
EmptyGraphGenerator<V,E>	A generator of empty graphs.
GnpGraphGenerator<V,E>	Generates a random graph using the G(n,p) model.
RecursiveMatrixGraphGenerator<V,E>	Generates a random graph using the R-MAT model.