| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
HGraph.Directed.Generator
Synopsis
- bidirectedCycle :: (Mutable t, Num a, Enum a) => t a -> a -> t a
- randomAcyclicDigraph :: forall {g} {t} {t}. (RandomGen g, Mutable t, DirectedGraph t, Integral t, Random t, Adjacency t) => t t -> t -> t -> StateT g Identity (t t)
- randomDigraph :: (Integral t, Mutable t, DirectedGraph t, Random t, RandomGen g, Adjacency t) => t t -> t -> t -> StateT g Identity (t t)
- oneWayGrid :: (Mutable t, DirectedGraph t, Num a, Enum a) => t a -> a -> a -> t a
Documentation
bidirectedCycle :: (Mutable t, Num a, Enum a) => t a -> a -> t a Source #
A cycle where vertices are connected in both directions
randomAcyclicDigraph :: forall {g} {t} {t}. (RandomGen g, Mutable t, DirectedGraph t, Integral t, Random t, Adjacency t) => t t -> t -> t -> StateT g Identity (t t) Source #
Generate a random weakly-connected acyclic digraph with n vertices and m + n - 1 arcs.
randomDigraph :: (Integral t, Mutable t, DirectedGraph t, Random t, RandomGen g, Adjacency t) => t t -> t -> t -> StateT g Identity (t t) Source #
oneWayGrid :: (Mutable t, DirectedGraph t, Num a, Enum a) => t a -> a -> a -> t a Source #