Max Flow

[davidm-public]

Hi, interesting project, wondering if it's possible to use this for the Max Flow problem with xor path segments?

Thanks

[jgFages]

Wow sorry for the delay!
Thanks! I don't know what are the xor path segments, do you mean disjoint paths?
It is not built-in but I think it should be easy to model it. Actually you can model it using the main choco-solver (on integer variables) only : saying a node has at most 1 predecessor is equivalent to saying flow variables of incoming arcs take value 0 at least size-1 time (count constraint)... So I would recommend you to start with a classical CP model before trying with a graph variable.