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 t) => t t -> t -> t t

completeTree :: (Integral t, Mutable t, UndirectedGraph t, Num t, Ord t) => t t -> t -> Int -> t t

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

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

randomTree :: (RandomGen g, Mutable t, Ord a, UndirectedGraph t, Num a, Enum a) => t a -> a -> StateT g Identity (t a)