transitive.closure: Computes the transitive closure of a directed graph
In cbg-ethz/pcNEM: Probabilistic combinatorial nested effects model

Description Usage Arguments Details Value Author(s) See Also Examples

Computes the transitive closure of a graph. Introduces a direct edge whenever there is a path between two nodes in a digraph.

1	transitive.closure(g, mat=FALSE, loops=TRUE)

`g`	graphNEL object or adjacency matrix.
`mat`	convert result to adjacency matrix.
`loops`	Add loops from each node to itself?

This function calculates the transitive closure of a given graph. We use the matrix exponential to find the transitive closure.

returns a graphNEL object or adjacency matrix

Florian Markowetz

transitive.reduction

   V <- LETTERS[1:3]
   edL <- list(A=list(edges="B"),B=list(edges="C"),C=list(edges=NULL))
   g <- new("graphNEL",nodes=V,edgeL=edL,edgemode="directed")
   gc <- transitive.closure(g,loops=FALSE)
    
  if(require(Rgraphviz)){
    par(mfrow=c(1,2))
    plot(g,main="NOT transitively closed")
    plot(gc,main="transitively closed")
  }