Documentation of 'edu.uci.ics.jung.algorithms.generators.random.ErdosRenyiGenerator' Java class
ErdosRenyiGenerator
edu.uci.ics.jung.algorithms.generators.random

Class ErdosRenyiGenerator<V,E>

  • All Implemented Interfaces:
    com.google.common.base.Supplier<Graph<V,E>>, GraphGenerator<V,E>


    public class ErdosRenyiGenerator<V,E>
    extends java.lang.Object
    implements GraphGenerator<V,E>
    Generates a random graph using the Erdos-Renyi binomial model (each pair of vertices is connected with probability p).
    • Constructor Summary

      Constructors 
      Constructor and Description
      ErdosRenyiGenerator(com.google.common.base.Supplier<UndirectedGraph<V,E>> graphFactory, com.google.common.base.Supplier<V> vertexFactory, com.google.common.base.Supplier<E> edgeFactory, int numVertices, double p) 
    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method and Description
      Graph<V,E> get()
      Returns a graph in which each pair of vertices is connected by an undirected edge with the probability specified by the constructor.
      void setSeed(long seed)
      Sets the seed of the internal random number generator to seed.
      • Methods inherited from class java.lang.Object

        equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
    • Constructor Detail

      • ErdosRenyiGenerator

        public ErdosRenyiGenerator(com.google.common.base.Supplier<UndirectedGraph<V,E>> graphFactory,
                                   com.google.common.base.Supplier<V> vertexFactory,
                                   com.google.common.base.Supplier<E> edgeFactory,
                                   int numVertices,
                                   double p)
        Parameters:
        graphFactory - factory for graphs of the appropriate type
        vertexFactory - factory for vertices of the appropriate type
        edgeFactory - factory for edges of the appropriate type
        numVertices - number of vertices graph should have
        p - Connection's probability between 2 vertices
    • Method Detail

      • get

        public Graph<V,E> get()
        Returns a graph in which each pair of vertices is connected by an undirected edge with the probability specified by the constructor.
        Specified by:
        get in interface com.google.common.base.Supplier<Graph<V,E>>
      • setSeed

        public void setSeed(long seed)
        Sets the seed of the internal random number generator to seed. Enables consistent behavior.
        Parameters:
        seed - the seed to use for the internal random number generator

DataMelt 3.0 © DataMelt by jWork.ORG

You see the box below because you did not login.