edu.stanford.math.plex4.graph.random

Class ErdosRenyiGraph

java.lang.Object

edu.stanford.math.plex4.graph.random.GraphInstanceGenerator

edu.stanford.math.plex4.graph.random.ErdosRenyiGraph

All Implemented Interfaces:

java.io.Serializable

public class ErdosRenyiGraph
extends GraphInstanceGenerator

Implements the Erdos-Renyi G(n,p) model. From Wikipedia: In the G(n, p) model, a graph is thought to be constructed by connecting nodes randomly. Each edge is included in the graph with probability p, with the presence or absence of any two distinct edges in the graph being independent.

Author:

Tim Harrington

See Also:

Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class edu.stanford.math.plex4.graph.random.GraphInstanceGenerator

GraphInstanceGenerator.ImplementationType

Field Summary

Fields

Modifier and Type	Field and Description
protected int	n
protected double	p

Fields inherited from class edu.stanford.math.plex4.graph.random.GraphInstanceGenerator

graphImplementation, implementationType

Constructor Summary

Constructors

Constructor and Description
ErdosRenyiGraph(int n, double p)

Method Summary

Methods

Modifier and Type	Method and Description
AbstractUndirectedGraph	generate()
java.lang.String	toString()

Methods inherited from class edu.stanford.math.plex4.graph.random.GraphInstanceGenerator

initializeGraph, setImplementationType

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

n

protected int n

p

protected double p

Constructor Detail

ErdosRenyiGraph

public ErdosRenyiGraph(int n,
               double p)

Parameters:

n -

k -

Method Detail

generate

public AbstractUndirectedGraph generate()

Specified by:

generate in class GraphInstanceGenerator

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object