Transitive closure of a graph
Computes the transitive closure of a graph (undirected or directed acyclic).
transClos(amat)
amat
: a Boolean matrix with dimnames representing the adjacency matrix of a graph.The transitive closure of a directed graph with adjacency matrix is a graph with adjacency matrix such that
if there is a directed path from to . The transitive closure of an undirected graph is defined similarly (by substituting path to directed path).
Giovanni M. Marchetti
DAG
, UG
## Closure of a DAG d <- DAG(y ~ x, x ~ z) transClos(d) ## Closure of an UG g <- UG(~ x*y*z+z*u+u*v) transClos(g)