pandora-0.1.2: A box of patterns and paradigms

Safe HaskellSafe
LanguageHaskell2010

Pandora.Paradigm.Structure.Concrete.Graph

Contents

Synopsis

Documentation

type Graph a = (Cofree :>: Edges) a Source #

Acyclic graph structure without loops

loose :: Traversable t => t a -> Graph a Source #

Transform any traversable structure into all loose edges graph

Orphan instances

Hollow Edges Source # 
Instance details

Methods

hollow :: r -> (Cofree Edges a -> r) -> (Cofree :>: Edges) a -> r Source #