1
0
This repository has been archived on 2025-03-06. You can view files and clone it, but cannot push or open issues or pull requests.
on-restart-benchmarks/share/minizinc/std/fzn_reachable_int.mzn
Jip J. Dekker f2a1c4e389 Squashed 'software/mza/' content from commit f970a59b17
git-subtree-dir: software/mza
git-subtree-split: f970a59b177c13ca3dd8aaef8cc6681d83b7e813
2021-07-11 16:34:30 +10:00

14 lines
598 B
MiniZinc

include "subgraph.mzn";
predicate fzn_reachable(int: N, int: E, array[int] of int: from, array[int] of int: to,
var int: r, array[int] of var bool: ns, array[int] of var bool: es) =
let {
array[1..2*E] of int: dfrom = from ++ to;
array[1..2*E] of int: dto = to ++ from;
array[1..2*E] of var bool: des = es ++ es;
} in
/* duplicate the edges so that the we can use directed graph reachability */
fzn_dreachable(N,2*E,dfrom,dto,r,ns,des);
%-----------------------------------------------------------------------------%