Data.DiGraph.Random

Throughout the module an undirected graph is a directed graph that is symmetric and irreflexive.

Random Regular Graph

type UniformRng m = (Int, Int) -> m Int

Type of a random number generator that uniformily chooses an element from a range.

rrgIO :: Natural -> Natural -> IO (Maybe (DiGraph Int))

Undirected, irreflexive random regular graph.

The algorithm here is incomplete. For a complete approach see for instance https://users.cecs.anu.edu.au/~bdm/papers/RandRegGen.pdf

rrg

Arguments

:: Monad m

=> UniformRng m

a uniform random number generator

-> Natural

-> Natural

-> m (Maybe (DiGraph Int))

Undirected, irreflexive random regular graph.

The algorithm here is incomplete. For a complete approach see for instance https://users.cecs.anu.edu.au/~bdm/papers/RandRegGen.pdf

Random Graphs in the \(G_{n,p}\) model

gnp :: forall m. Monad m => UniformRng m -> Natural -> Double -> m (DiGraph Int)

Undirected irreflexive random graph in the \(G_{n,p}\) model.