Safe Haskell | Safe |
---|---|

Language | Haskell98 |

# Documentation

trc :: DynGraph gr => gr a b -> gr a () Source #

Finds the transitive, reflexive 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 either i = j or there is a path from i to j in G}