Paths Graph documentation¶
The Paths Graph (PG), and its derivative the Cycle-Free Paths Graph (CFPG), represent a set of paths of interest without explicitly enumerating them. Using the PG and CFPG, queries concerning a set of paths can be answered by performing graphical operations on the rather than on the underlying directed network.
The Paths Graph code is made available under the 2-clause BSD license. The software was developed with funding from ARO grant W911NF-14-1-0397, “Programmatic modelling for reasoning across complex mechanisms” under the DARPA Big Mechanism program, and W911NF-14-1-0391, “Active context” under the DARPA Communicating with Computers program.