Language.Haskell.TH.TypeGraph.Graph

Abstract operations on Maps containing graph edges.

Documentation

type GraphEdges label key = Map key (label, Set key)

graphFromMap :: forall label key. Ord key => GraphEdges label key -> (Graph, Vertex -> (label, key, [key]), key -> Maybe Vertex)

Build a graph from the result of typeGraphEdges, each edge goes from a type to one of the types it contains. Thus, each edge represents a primitive lens, and each path in the graph is a composition of lenses.

cut :: (Eq a, Ord a) => Set a -> GraphEdges label a -> GraphEdges label a

Isolate and remove some nodes

cutM :: (Functor m, Monad m, Eq a, Ord a) => (a -> m Bool) -> GraphEdges label a -> m (GraphEdges label a)

Monadic predicate version of cut.

isolate :: (Eq a, Ord a) => Set a -> GraphEdges label a -> GraphEdges label a

Remove all the in- and out-edges of some nodes

isolateM :: (Functor m, Monad m, Eq a, Ord a) => (a -> m Bool) -> GraphEdges label a -> m (GraphEdges label a)

Monadic predicate version of isolate.

dissolve :: (Eq a, Ord a) => Set a -> GraphEdges label a -> GraphEdges label a

Remove some nodes and extend each of their in-edges to each of their out-edges

dissolveM :: (Functor m, Monad m, Eq a, Ord a) => (a -> m Bool) -> GraphEdges label a -> m (GraphEdges label a)

Monadic predicate version of dissolve.