Safe Haskell	Safe-Inferred
Language	Haskell2010

Downhill.Internal.Graph.Graph

Contents

Synopsis

data Graph s e a z = BasicVector a => Graph {
- graphInnerNodes :: NodeMap s (Node s e a)
- graphFinalNode :: Node s e a z
}
data Node s e a v = BasicVector v => Node [Edge s e a v]
data SomeGraph e a z where
- SomeGraph :: IsNodeSet s => Graph s e a z -> SomeGraph e a z
evalGraph :: forall s x z. Graph s FwdFun z x -> z -> x
transposeGraph :: forall s f g a z. IsNodeSet s => (forall u v. f u v -> g v u) -> Graph s f a z -> Graph s g z a
unsafeFromOpenGraph :: (BasicVector a, HasCallStack) => OpenGraph a v -> SomeGraph BackFun a v

Graph type

data Graph s e a z Source #

Constructors

BasicVector a => Graph
Fields graphInnerNodes :: NodeMap s (Node s e a) graphFinalNode :: Node s e a z

data Node s e a v Source #

Inner node. This does not include initial node. Contains a list of ingoing edges.

Constructors

BasicVector v => Node [Edge s e a v]

data SomeGraph e a z where Source #

Constructors

Evaluate

evalGraph :: forall s x z. Graph s FwdFun z x -> z -> x Source #

Forward mode evaluation

transposeGraph :: forall s f g a z. IsNodeSet s => (forall u v. f u v -> g v u) -> Graph s f a z -> Graph s g z a Source #

Reverse edges. Turns reverse mode evaluation into forward mode.

Will crash if graph has invalid keys