-
Notifications
You must be signed in to change notification settings - Fork 78
/
reachable.mzn
82 lines (73 loc) · 4.49 KB
/
reachable.mzn
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
include "fzn_reachable_int.mzn";
include "fzn_reachable_int_reif.mzn";
include "fzn_reachable_enum.mzn";
include "fzn_reachable_enum_reif.mzn";
include "fzn_dreachable_int.mzn";
include "fzn_dreachable_int_reif.mzn";
include "fzn_dreachable_enum.mzn";
include "fzn_dreachable_enum_reif.mzn";
/** @group globals.graph
Constrains the subgraph \a ns and \a es of a given directed graph to be reachable from \a r.
@param N: the number of nodes in the given graph
@param E: the number of edges in the given graph
@param from: the leaving node 1..\a N for each edge
@param to: the entering node 1..\a N for each edge
@param r: the root node (which may be variable)
@param ns: a Boolean for each node whether it is in the subgraph
@param es: a Boolean for each edge whether it is in the subgraph
*/
predicate dreachable(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) =
assert(index_set(from) = 1..E,"dreachable: index set of from must be 1..\(E)") /\
assert(index_set(to) = 1..E,"dreachable: index set of to must be 1..\(E)") /\
assert(index_set(ns) = 1..N,"dreachable: index set of ns must be 1..\(N)") /\
assert(index_set(es) = 1..E,"dreachable: index set of es must be 1..\(E)") /\
fzn_dreachable(N,E,from,to,r,ns,es);
/** @group globals.graph
Constrains the subgraph \a ns and \a es of a given directed graph to be reachable from \a r.
@param from: the leaving node for each edge
@param to: the entering node for each edge
@param r: the root node (which may be variable)
@param ns: a Boolean for each node whether it is in the subgraph
@param es: a Boolean for each edge whether it is in the subgraph
*/
predicate dreachable(array[int] of $$N: from, array[int] of $$N: to,
var $$N: r, array[$$N] of var bool: ns, array[int] of var bool: es) =
assert(index_set(from) = index_set(to),"dreachable: index set of from and to must be identical") /\
assert(index_set(from) = index_set(es),"dreachable: index set of from and es must be identical") /\
assert(dom_array(from) subset index_set(ns),"dreachable: nodes in from must be in index set of ns") /\
assert(dom_array(from) subset index_set(ns),"dreachable: nodes in to must be in index set of ns") /\
fzn_dreachable(from,to,r,ns,es);
%-----------------------------------------------------------------------------%
/** @group globals.graph
Constrains the subgraph \a ns and \a es of a given undirected graph to be reachable from \a r.
@param N: the number of nodes in the given graph
@param E: the number of edges in the given graph
@param from: the leaving node 1..\a N for each edge
@param to: the entering node 1..\a N for each edge
@param r: the root node (which may be variable)
@param ns: a Boolean for each node whether it is in the subgraph
@param es: a Boolean for each edge whether it is in the subgraph
*/
predicate 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) =
assert(index_set(from) = 1..E,"reachable: index set of from must be 1..\(E)") /\
assert(index_set(to) = 1..E,"reachable: index set of to must be 1..\(E)") /\
assert(index_set(ns) = 1..N,"reachable: index set of ns must be 1..\(N)") /\
assert(index_set(es) = 1..E,"reachable: index set of es must be 1..\(E)") /\
fzn_reachable(N,E,from,to,r,ns,es);
/** @group globals.graph
Constrains the subgraph \a ns and \a es of a given undirected graph to be reachable from \a r.
@param from: the leaving node for each edge
@param to: the entering node for each edge
@param r: the root node (which may be variable)
@param ns: a Boolean for each node whether it is in the subgraph
@param es: a Boolean for each edge whether it is in the subgraph
*/
predicate reachable(array[int] of $$N: from, array[int] of $$N: to,
var $$N: r, array[$$N] of var bool: ns, array[int] of var bool: es) =
assert(index_set(from) = index_set(to),"reachable: index set of from and to must be identical") /\
assert(index_set(from) = index_set(es),"reachable: index set of from and es must be identical") /\
assert(dom_array(from) subset index_set(ns),"reachable: nodes in from must be in index set of ns") /\
assert(dom_array(from) subset index_set(ns),"reachable: nodes in to must be in index set of ns") /\
fzn_reachable(from,to,r,ns,es);