Package org.graph4j.generators

Class RandomGnpGraphGenerator

java.lang.Object

org.graph4j.generators.AbstractGraphGenerator

org.graph4j.generators.RandomGnpGraphGenerator

public class RandomGnpGraphGenerator
extends AbstractGraphGenerator

Generator for Erdős–Rényi G(n,p) model. Each possible edge is added considering a given probability. The time complexity of the algorithm is O(n^2), since it iterates through all possible edges, so it is not efficient for large sparse graphs.

Author:

Cristian Frăsinaru

See Also:

• RandomGnmGraphGenerator

Field Summary

Fields inherited from class org.graph4j.generators.AbstractGraphGenerator

vertices

Constructor Summary

Constructors

Constructor	Description
RandomGnpGraphGenerator(int[] vertices, double edgeProbability)
RandomGnpGraphGenerator(int numVertices, double edgeProbability)
RandomGnpGraphGenerator(int firstVertex, int lastVertex, double edgeProbability)

Method Summary

Modifier and Type	Method	Description
Digraph	createDigraph()
DirectedMultigraph	createDirectedMultigraph()
DirectedPseudograph	createDirectedPseudograph()
Graph	createGraph()
Multigraph	createMultiGraph()
Network	createNetwork()
Pseudograph	createPseudograph()

Methods inherited from class org.graph4j.generators.AbstractGraphGenerator

addRandomEdges

Methods inherited from class java.lang.Object

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

Constructor Details

RandomGnpGraphGenerator

public RandomGnpGraphGenerator(int numVertices,
 double edgeProbability)

Parameters:

numVertices - number of vertices.

edgeProbability - probability that two vertices are connected.

RandomGnpGraphGenerator

public RandomGnpGraphGenerator(int firstVertex,
 int lastVertex,
 double edgeProbability)

Parameters:

firstVertex - first vertex number of the graph.

lastVertex - last vertex number of the graph.

edgeProbability - probability that two vertices are connected.

RandomGnpGraphGenerator

public RandomGnpGraphGenerator(int[] vertices,
 double edgeProbability)

Parameters:

vertices - the vertices of the graph.

edgeProbability - probability that two vertices are connected.

Method Details

createGraph

public Graph createGraph()

Returns:

a random graph.

createDigraph

public Digraph createDigraph()

Returns:

a random directed graph.

createNetwork

public Network createNetwork()

Returns:

a random network.

createMultiGraph

public Multigraph createMultiGraph()

Returns:

a random multigraph.

createDirectedMultigraph

public DirectedMultigraph createDirectedMultigraph()

Returns:

a random directed multigraph.

createPseudograph

public Pseudograph createPseudograph()

Returns:

a random pseudograph.

createDirectedPseudograph

public DirectedPseudograph createDirectedPseudograph()

Returns:

a random directed pseudograph.