conflict-graph.cpp
Go to the documentation of this file.00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 00002 /* 00003 * Main authors: 00004 * Christian Schulte <schulte@gecode.org> 00005 * 00006 * Copyright: 00007 * Christian Schulte, 2014 00008 * 00009 * Last modified: 00010 * $Date: 2016-04-19 17:19:45 +0200 (Tue, 19 Apr 2016) $ by $Author: schulte $ 00011 * $Revision: 14967 $ 00012 * 00013 * This file is part of Gecode, the generic constraint 00014 * development environment: 00015 * http://www.gecode.org 00016 * 00017 * Permission is hereby granted, free of charge, to any person obtaining 00018 * a copy of this software and associated documentation files (the 00019 * "Software"), to deal in the Software without restriction, including 00020 * without limitation the rights to use, copy, modify, merge, publish, 00021 * distribute, sublicense, and/or sell copies of the Software, and to 00022 * permit persons to whom the Software is furnished to do so, subject to 00023 * the following conditions: 00024 * 00025 * The above copyright notice and this permission notice shall be 00026 * included in all copies or substantial portions of the Software. 00027 * 00028 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00029 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00030 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00031 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 00032 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 00033 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 00034 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 00035 * 00036 */ 00037 00038 #include <gecode/int/bin-packing.hh> 00039 00040 namespace Gecode { namespace Int { namespace BinPacking { 00041 00042 ExecStatus 00043 ConflictGraph::bk(NodeSet& p, NodeSet& x) { 00044 assert(!(p.none(nodes()) && x.none(nodes()))); 00045 // Iterate over neighbors of pivot node 00046 Nodes n(node[pivot(p,x)].n); 00047 // Iterate over elements of p 00048 Nodes i(p); 00049 // The loop iterates over elements in i - n 00050 while (i() < nodes()) { 00051 int iv = i(), nv = n(); 00052 if ((n() < nodes()) && (iv == nv)) { 00053 ++i; ++n; 00054 } else if ((n() < nodes()) && (iv > nv)) { 00055 ++n; 00056 } else { 00057 ++i; ++n; 00058 00059 Region reg(home); 00060 00061 // Found i.val() to be in i - n 00062 00063 NodeSet np, nx; 00064 np.allocate(reg,nodes()); 00065 nx.allocate(reg,nodes()); 00066 00067 bool empty = NodeSet::iwn(np,p,nx,x,node[iv].n,nodes()); 00068 00069 p.excl(iv); x.incl(iv); 00070 00071 // Update current clique 00072 cur.incl(iv,node[iv].w); 00073 00074 if (empty) { 00075 // Found a max clique 00076 GECODE_ES_CHECK(clique()); 00077 } else { 00078 GECODE_ES_CHECK(bk(np,nx)); 00079 } 00080 00081 // Reset current clique 00082 cur.excl(iv,node[iv].w); 00083 } 00084 } 00085 return ES_OK; 00086 } 00087 00088 }}} 00089 00090 // STATISTICS: int-prop 00091