auxiliary file for SID: computes a path matrix efficiently (can probably be made faster) The only difference to the function computePathMatrix is that this function changes the graph by removing all edges that leave condSet. If condSet is empty, it just returns PathMatrix1.

1 | ```
computePathMatrix2(G,condSet,PathMatrix1, spars=FALSE)
``` |

`G` |
graph. |

`condSet` |
set of variables |

`PathMatrix1` |
PathMatrix1 |

`spars` |
boolean indicating whether the matrices are sparse |

pathMatrix

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

`structIntervDist`

`computePathMatrix`

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.