dlvhex
2.5.0
|
00001 /* dlvhex -- Answer-Set Programming with external interfaces. 00002 * Copyright (C) 2005-2007 Roman Schindlauer 00003 * Copyright (C) 2006-2015 Thomas Krennwallner 00004 * Copyright (C) 2009-2016 Peter Schüller 00005 * Copyright (C) 2011-2016 Christoph Redl 00006 * Copyright (C) 2015-2016 Tobias Kaminski 00007 * Copyright (C) 2015-2016 Antonius Weinzierl 00008 * 00009 * This file is part of dlvhex. 00010 * 00011 * dlvhex is free software; you can redistribute it and/or modify it 00012 * under the terms of the GNU Lesser General Public License as 00013 * published by the Free Software Foundation; either version 2.1 of 00014 * the License, or (at your option) any later version. 00015 * 00016 * dlvhex is distributed in the hope that it will be useful, but 00017 * WITHOUT ANY WARRANTY; without even the implied warranty of 00018 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00019 * Lesser General Public License for more details. 00020 * 00021 * You should have received a copy of the GNU Lesser General Public 00022 * License along with dlvhex; if not, write to the Free Software 00023 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 00024 * 02110-1301 USA. 00025 */ 00026 00034 #ifdef HAVE_CONFIG_H 00035 #include "config.h" 00036 #endif // HAVE_CONFIG_H 00037 00038 #include "dlvhex2/EvalHeuristicMonolithic.h" 00039 #include "dlvhex2/Logger.h" 00040 00041 DLVHEX_NAMESPACE_BEGIN 00042 00043 EvalHeuristicMonolithic::EvalHeuristicMonolithic(): 00044 Base() 00045 { 00046 } 00047 00048 00049 EvalHeuristicMonolithic::~EvalHeuristicMonolithic() 00050 { 00051 } 00052 00053 00054 // trivial strategy: 00055 // do a topological sort of the tree 00056 // build eval units in that order 00057 void EvalHeuristicMonolithic::build(EvalGraphBuilder& builder) 00058 { 00059 typedef ComponentGraph::Component Component; 00060 const ComponentGraph& compgraph = builder.getComponentGraph(); 00061 std::list<Component> comps(compgraph.getComponents().first, compgraph.getComponents().second), constraintcomps; 00062 EvalGraphBuilder::EvalUnit u = builder.createEvalUnit(comps, constraintcomps); 00063 LOG(ANALYZE,"got since eval unit " << u); 00064 } 00065 00066 00067 DLVHEX_NAMESPACE_END 00068 00069 00070 // vim:expandtab:ts=4:sw=4: 00071 // mode: C++ 00072 // End: