powered by
Computes the transitive reduction of the path matrix of a directed acyclic graph.
trReduc(paths, n)
a two column integer matrix containing all pairs of nodes which are linked by a path of edges.
the number of nodes.
A two column matrix giving all pairs of edges (i,j) such that there exists a directed edge from node i to node j.
(i,j)
i
j
For each k, all indirect paths going through node k are removed (if there are any).
k