/*
* Copyright (c) 2003, The JUNG Authors
*
* All rights reserved.
*
* This software is open-source under the BSD license; see either
* "license.txt" or
* https://github.com/jrtom/jung/blob/master/LICENSE for a description.
*/
package edu.uci.ics.jung.algorithms.generators.random;
import java.util.ArrayList;
import java.util.List;
import java.util.Random;
import com.google.common.base.Supplier;
import edu.uci.ics.jung.algorithms.generators.GraphGenerator;
import edu.uci.ics.jung.graph.Graph;
import edu.uci.ics.jung.graph.UndirectedGraph;
/**
* Generates a random graph using the Erdos-Renyi binomial model
* (each pair of vertices is connected with probability p).
*
* @author William Giordano, Scott White, Joshua O'Madadhain
*/
public class ErdosRenyiGenerator implements GraphGenerator {
private int mNumVertices;
private double mEdgeConnectionProbability;
private Random mRandom;
Supplier> graphFactory;
Supplier vertexFactory;
Supplier edgeFactory;
/**
*
* @param graphFactory factory for graphs of the appropriate type
* @param vertexFactory factory for vertices of the appropriate type
* @param edgeFactory factory for edges of the appropriate type
* @param numVertices number of vertices graph should have
* @param p Connection's probability between 2 vertices
*/
public ErdosRenyiGenerator(Supplier> graphFactory,
Supplier vertexFactory, Supplier edgeFactory,
int numVertices,double p)
{
if (numVertices <= 0) {
throw new IllegalArgumentException("A positive # of vertices must be specified.");
}
mNumVertices = numVertices;
if (p < 0 || p > 1) {
throw new IllegalArgumentException("p must be between 0 and 1.");
}
this.graphFactory = graphFactory;
this.vertexFactory = vertexFactory;
this.edgeFactory = edgeFactory;
mEdgeConnectionProbability = p;
mRandom = new Random();
}
/**
* Returns a graph in which each pair of vertices is connected by
* an undirected edge with the probability specified by the constructor.
*/
public Graph get() {
UndirectedGraph g = graphFactory.get();
for(int i=0; i list = new ArrayList(g.getVertices());
for (int i = 0; i < mNumVertices-1; i++) {
V v_i = list.get(i);
for (int j = i+1; j < mNumVertices; j++) {
V v_j = list.get(j);
if (mRandom.nextDouble() < mEdgeConnectionProbability) {
g.addEdge(edgeFactory.get(), v_i, v_j);
}
}
}
return g;
}
/**
* Sets the seed of the internal random number generator to {@code seed}.
* Enables consistent behavior.
*
* @param seed the seed to use for the internal random number generator
*/
public void setSeed(long seed) {
mRandom.setSeed(seed);
}
}
Ads help maintain this website.