Language.Haskell.TH.TypeGraph.Graph

Abstract operations on Maps containing graph edges.

Documentation

type GraphEdges v = Map v (Set v)

cutVertex :: (Eq a, Ord a) => a -> GraphEdges a -> GraphEdges a

Remove a node and all its in- and out-edges.

cutVertices :: (Eq a, Ord a) => (a -> Bool) -> GraphEdges a -> GraphEdges a

Cut vertices for which the predicate returns False

cutVerticesM :: (Monad m, Eq a, Ord a) => (a -> m Bool) -> GraphEdges a -> m (GraphEdges a)

Cut vertices for which the predicate returns False

mergeVertex :: (Eq a, Ord a) => a -> GraphEdges a -> GraphEdges a

Merge a node into the nodes that are its in-edges.

mergeVertices :: (Eq a, Ord a) => (a -> Bool) -> GraphEdges a -> GraphEdges a

mergeVerticesM :: (Monad m, Ord a) => (a -> m Bool) -> GraphEdges a -> m (GraphEdges a)

partitionM :: forall m a. Monad m => (a -> m Bool) -> [a] -> m ([a], [a])

flatten :: Ord a => Set (Set a) -> Set a

graphFromMap :: forall node key a. (Ord a, node ~ a, key ~ a) => GraphEdges a -> (Graph, Vertex -> (node, 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.