circuit.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, 2006 00008 * 00009 * Last modified: 00010 * $Date: 2010-06-04 16:13:00 +0200 (Fri, 04 Jun 2010) $ by $Author: schulte $ 00011 * $Revision: 11028 $ 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/graph/circuit.hh> 00039 00040 namespace Gecode { 00041 00042 void 00043 circuit(Home home, const IntVarArgs& x, IntConLevel icl) { 00044 if (x.same(home)) 00045 throw Int::ArgumentSame("Graph::circuit"); 00046 if (x.size() == 0) 00047 throw Int::TooFewArguments("Graph::circuit"); 00048 if (home.failed()) return; 00049 ViewArray<Int::IntView> xv(home,x); 00050 if (icl == ICL_DOM) { 00051 GECODE_ES_FAIL(Graph::Circuit::Dom<Int::IntView>::post(home,xv)); 00052 } else { 00053 GECODE_ES_FAIL(Graph::Circuit::Val<Int::IntView>::post(home,xv)); 00054 } 00055 } 00056 00057 void 00058 circuit(Home home, const IntArgs& c, 00059 const IntVarArgs& x, const IntVarArgs& y, IntVar z, 00060 IntConLevel icl) { 00061 int n = x.size(); 00062 if ((y.size() != n) || (c.size() != n*n)) 00063 throw Int::ArgumentSizeMismatch("Graph::circuit"); 00064 circuit(home, x, icl); 00065 if (home.failed()) return; 00066 IntArgs cx(n); 00067 for (int i=n; i--; ) { 00068 for (int j=0; j<n; j++) 00069 cx[j] = c[i*n+j]; 00070 element(home, cx, x[i], y[i]); 00071 } 00072 linear(home, y, IRT_EQ, z); 00073 } 00074 00075 void 00076 circuit(Home home, const IntArgs& c, 00077 const IntVarArgs& x, IntVar z, 00078 IntConLevel icl) { 00079 if (home.failed()) return; 00080 IntVarArgs y(home, x.size(), Int::Limits::min, Int::Limits::max); 00081 circuit(home, c, x, y, z, icl); 00082 } 00083 00084 } 00085 00086 // STATISTICS: graph-post