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: