Package edu.uci.ics.jung.random.generators

Provides a series of methods for generating new graphs with various properties.

See:
Description

Interface Summary

EvolvingGraphGenerator	An interface for algorithms that generate graphs that evolve over time
GraphGenerator	An interface for algorithms that generate graphs

Class Summary

BarabasiAlbertGenerator	Simple evolving scale-free random graph generator.
EppsteinPowerLawGenerator	Graph generator that generates undirected sparse graphs with power-law distributions.
ErdosRenyiGenerator	Random Generator of Erdos-Renyi "binomial model"
KleinbergSmallWorldGenerator	Graph generator that produces a random graph with small world properties.
Lattice1DGenerator	Simple generator of an n x 1 lattice where each vertex is incident with each of its 2 neighbors (except possibly for the vertices on the edge depending upon whether the lattice is specified to be toroidal or not).
Lattice2DGenerator	Simple generator of an n x n lattice where each vertex is incident with each of its 4 neighbors (except possibly for the vertices on the edge depending upon whether the lattice is specified to be toroidal or not).
SimpleRandomGenerator	Simple graph generator where |V| vertices are generated and |E| random edges chosen pairwise uniformly
WattsBetaSmallWorldGenerator	WattsBetaSmallWorldGenerator is a graph generator that produces a small world network using the beta-model as proposed by Duncan Watts.

Package edu.uci.ics.jung.random.generators Description

Provides a series of methods for generating new graphs with various properties.