auxiliary file for SID: computes a path matrix efficiently (can probably be made faster) This function takes an adjacency matrix G from a DAG and computes a path matrix for which entry(i,j) being one means that there is a directed path from i to j the diagonal will also be one.

1 | ```
computePathMatrix(G, spars=FALSE)
``` |

`G` |
graph. |

`spars` |
boolean indicating whether G is a sparse matrix. |

pathMatrix

Jonas Peters <jonas.peters@tuebingen.mpg.de>

`structIntervDist`

`computePathMatrix2`

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.