3.7.173. Path

A constraint allowing for expressing the fact that we search for one or several vertex -disjoint simple paths. Within a digraph a simple path is a set of links that are traversed in the same direction and such that each vertex of the simple path is visited exactly once.