this repo has no description
dekker.one
1predicate fzn_reachable_reif(array[int] of $$N: from, array[int] of $$N: to,
2 var $$N: r, array[$$N] of var bool: ns, array[int] of var bool: es,
3 var bool: b) =
4 let {
5 int: E = length(es);
6 set of int: NODE = min(index_set(ns))..max(index_set(ns));
7 array[1..2*E] of NODE: dfrom = from ++ to;
8 array[1..2*E] of NODE: dto = to ++ from;
9 array[1..2*E] of var bool: des = es ++ es;
10 array[NODE] of var bool: dns = array1d(NODE,ns);
11 var NODE: dr = r;
12 } in
13 /* duplicate the edges so that we can use directed graph reachability */
14 b <-> fzn_dreachable(dfrom,dto,dr,dns,des);
15
16%-----------------------------------------------------------------------------%