HGraph.Undirected.Generator

Documentation

grid :: (Num a, Num b, Enum a, Enum b, Mutable t) => t (a, b) -> a -> b -> t (a, b)

cycleGraph :: (Mutable t, Integral a) => t a -> a -> t a

completeTree :: (UndirectedGraph t1, Integral a, Mutable t1, Num t2, Ord t2) => t1 a -> t2 -> Int -> t1 a

completeGraph :: (Mutable t, UndirectedGraph t, Num a, Enum a) => t a -> a -> t a

randomGraph :: (Integral t1, Mutable t2, Random t1, RandomGen g, Adjacency t2) => t2 t1 -> t1 -> t1 -> StateT g Identity (t2 t1)