Data.Graph.Generators.Random.BarabasiAlbert

Graph generators

barabasiAlbertGraph

Arguments

:: GenIO

The random number generator to use

-> Int

The overall number of nodes (n)

-> Int

The number of edges to create between a new and existing nodes (m)

-> IO GraphInfo

The resulting graph (IO required for randomness)

barabasiAlbertGraph'

Arguments

:: Int

The number of nodes

-> Int

The number of edges to create between a new and existing nodes (m)

-> IO GraphInfo

The resulting graph (IO required for randomness)

Utility functions

selectNth :: Int -> [(Int, Int)] -> Int

Select the nth element from a multiset occur list, treating it as virtual large list This is significantly faster than building up the entire list and selecting the nth element

selectRandomElement :: GenIO -> (IntMultiSet, Int) -> IO Int

Select a single random element from the multiset, with precalculated size Note that the given size must be the total multiset size, not the number of distinct elements in said se

selectNDistinctRandomElements :: GenIO -> Int -> (IntMultiSet, Int) -> IO [Int]

Select n distinct random elements from a multiset, with This function will fail to terminate if there are less than n distinct elements in the multiset. This function accepts a multiset with precomputed size for performance reasons