this repo has no description
dekker.one
1/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2/*
3 * Main authors:
4 * Christian Schulte <schulte@gecode.org>
5 *
6 * Copyright:
7 * Christian Schulte, 2014
8 *
9 * This file is part of Gecode, the generic constraint
10 * development environment:
11 * http://www.gecode.org
12 *
13 * Permission is hereby granted, free of charge, to any person obtaining
14 * a copy of this software and associated documentation files (the
15 * "Software"), to deal in the Software without restriction, including
16 * without limitation the rights to use, copy, modify, merge, publish,
17 * distribute, sublicense, and/or sell copies of the Software, and to
18 * permit persons to whom the Software is furnished to do so, subject to
19 * the following conditions:
20 *
21 * The above copyright notice and this permission notice shall be
22 * included in all copies or substantial portions of the Software.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31 *
32 */
33
34#include <gecode/int/bin-packing.hh>
35
36namespace Gecode { namespace Int { namespace BinPacking {
37
38 ExecStatus
39 ConflictGraph::bk(NodeSet& p, NodeSet& x) {
40 assert(!(p.none(nodes()) && x.none(nodes())));
41 // Iterate over neighbors of pivot node
42 Nodes n(node[pivot(p,x)].n);
43 // Iterate over elements of p
44 Nodes i(p);
45 // The loop iterates over elements in i - n
46 while (i() < nodes()) {
47 int iv = i(), nv = n();
48 if ((n() < nodes()) && (iv == nv)) {
49 ++i; ++n;
50 } else if ((n() < nodes()) && (iv > nv)) {
51 ++n;
52 } else {
53 ++i; ++n;
54
55 Region reg;
56
57 // Found i.val() to be in i - n
58
59 NodeSet np, nx;
60 np.allocate(reg,nodes());
61 nx.allocate(reg,nodes());
62
63 bool empty = NodeSet::iwn(np,p,nx,x,node[iv].n,nodes());
64
65 p.excl(iv); x.incl(iv);
66
67 // Update current clique
68 cur.incl(iv,node[iv].w);
69
70 if (empty) {
71 // Found a max clique
72 GECODE_ES_CHECK(clique());
73 } else {
74 GECODE_ES_CHECK(bk(np,nx));
75 }
76
77 // Reset current clique
78 cur.excl(iv,node[iv].w);
79 }
80 }
81 return ES_OK;
82 }
83
84}}}
85
86// STATISTICS: int-prop
87