caffegraph-0.1.0.2

Safe HaskellNone
LanguageHaskell2010

NN.Graph

Synopsis

Documentation

type G a = State (Node, Gr a ()) Source

sequential :: [a] -> G a (Node, Node) Source

layer :: a -> G a (Node, Node) Source

layer' :: a -> G a Node Source

data Attach Source

Constructors

From Node 
To Node 

attach :: Attach -> a -> G a () Source

(>->) :: Node -> Node -> G a () Source

stack :: [G a (Node, Node)] -> G a (Node, Node) Source

(>-) :: G a (Node, Node) -> G a (Node, Node) -> G a (Node, Node) Source

data Gr a b :: * -> * -> *

Instances

Graph Gr 
DynGraph Gr 
(Eq a, Ord b) => Eq (Gr a b) 
(Read a, Read b) => Read (Gr a b) 
(Show a, Show b) => Show (Gr a b) 

type Node = Int

Unlabeled node