Finds the reflexive-transitive closure of a directed graph. Given a graph G=(V,E), its reflexive-transitive closure is the graph: G* = (V,E*) where E*={(i,j): i,j in V and either i = j or there is a path from i to j in G}
Modulefgl-5.8.2.0Haskell98
Data.Graph.Inductive.Query.TransClos
- 3 values
- Packagefgl-5.8.2.0
- Exports3
- LanguageHaskell98
- LicenceBSD-3-Clause
- SourceTransClos.hs
Finds the reflexive closure of a directed graph. Given a graph G=(V,E), its reflexive closure is the graph: G* = (V,Er union E) where Er = {(i,i): i in V}
Finds the transitive closure of a directed graph. Given a graph G=(V,E), its transitive closure is the graph: G* = (V,E*) where E*={(i,j): i,j in V and there is a path from i to j in G}