dfs.cc
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, 2003 00008 * 00009 * Last modified: 00010 * $Date: 2008-01-19 13:19:23 +0100 (Sat, 19 Jan 2008) $ by $Author: schulte $ 00011 * $Revision: 5916 $ 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/search.hh" 00039 00040 namespace Gecode { namespace Search { 00041 00042 /* 00043 * Control for DFS 00044 * 00045 */ 00046 00047 DFS::DFS(Space* s, unsigned int c_d, unsigned int a_d, Stop* st, size_t sz) 00048 : e(c_d,a_d,st,sz) { 00049 unsigned long int p = 0; 00050 Space* c = (s->status(p) == SS_FAILED) ? NULL : s->clone(); 00051 e.init(c); 00052 e.propagate += p; 00053 e.current(s); 00054 e.current(NULL); 00055 e.current(c); 00056 if (c == NULL) 00057 e.fail += 1; 00058 } 00059 00060 Space* 00061 DFS::next(void) { 00062 return e.explore(); 00063 } 00064 00065 bool 00066 DFS::stopped(void) const { 00067 return e.stopped(); 00068 } 00069 00070 Statistics 00071 DFS::statistics(void) const { 00072 Statistics s = e; 00073 s.memory += e.stacksize(); 00074 return s; 00075 } 00076 00077 }} 00078 00079 // STATISTICS: search-any