graph-rewriting-0.6.0: Monadic graph rewriting of hypergraphs with ports and multiedges

Safe HaskellNone




mergeEs :: View [Port] n => [Edge] -> State (Graph n) ()Source

joinEdges :: [[Edge]] -> [[Edge]]Source

join :: [Set] -> [Set]Source

Join pairs of sets with a common element until all sets are disjoint.

join1 :: Set -> [Set] -> [Set]Source

Add to a list of disjoint sets a further set and join sets with common elements such that the resulting list again only contains disjoint sets.