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


package edu.uci.ics.jung.algorithms.generators.random
Methods for generating random graphs with various properties. These include:
  • BarabasiAlbertGenerator: scale-free graphs using the preferential attachment heuristic.
  • EppsteinPowerLawGenerator: graphs whose degree distribution approximates a power law
  • ErdosRenyiGenerator: graphs for which edges are created with a specified probability
  • MixedRandomGraphGenerator: takes the output of BarabasiAlbertGenerator and perturbs it to generate a mixed-mode analog with both directed and undirected edges.