IGraph.Generators

Documentation

full

Arguments

:: SingI d

=> Int

The number of vertices in the graph.

-> Bool

Whether to include self-edges (loops)

-> Graph d () ()

star

Arguments

:: Int

The number of nodes

-> Graph U () ()

Return the Star graph. The center node is always associated with id 0.

data ErdosRenyiModel

Constructors

GNP Int Double

GNM Int Int

erdosRenyiGame

Arguments

:: SingI d

=> ErdosRenyiModel

-> Bool

self-loop

-> IO (Graph d () ())

degreeSequenceGame

Arguments

:: [Int]

Out degree

-> [Int]

In degree

-> IO (Graph D () ())

Generates a random graph with a given degree sequence.

rewire

Arguments

:: (Hashable v, Serialize v, Eq v, Serialize e)

=> Int

Number of rewiring trials to perform.

-> Graph d v e

-> IO (Graph d v e)

Randomly rewires a graph while preserving the degree distribution.