Stable Dev Build Status Coverage Code Style: Blue


This package implements algorithms for solving Generalized Constrained Shortest Paths problems. It implements a simplified version of the framework from Parmentier 2017, restricted to acyclic directed graphs.

Let $D=(V, A)$ an acyclic directed graph, $o, d\in V$ origin and destination vertices, $c$ a cost function, and $\mathcal{P} \subset \mathcal{P}_{od}$ a subset of $o-d$ paths in $G$. This package can compute the corresponding constrained shortest path:

$$ \boxed{\begin{aligned} P^\star = \arg\min\quad & c(P)\ \text{s.t.}\quad & P\in \mathcal{P} \end{aligned}} $$

See the documentation for more details.


To install this package, open a julia REPL and run the following command in pkg mode:

add ConstrainedShortestPaths