Computes the transitive closure of a graph (undirected or directed
acyclic).
Usage
transClos(amat)
Value
A
The adjacency matrix of the transitive closure.
Arguments
amat
a Boolean matrix with dimnames representing the adjacency
matrix
of a graph.
Author
Giovanni M. Marchetti
Details
The transitive closure of a directed graph with adjacency matrix \(A\) is a
graph with adjacency matrix \(A^*\) such that \(A^*_{i,j} = 1\)
if there is a directed path from \(i\) to \(j\). The transitive
closure of an undirected graph is defined similarly (by substituting
path to directed path).