dlvhex
2.5.0
|
Implementation of a nontrivial but simple evaluation heuristic. More...
#include "dlvhex2/EvalHeuristicEasy.h"
#include "dlvhex2/EvalHeuristicShared.h"
#include "dlvhex2/Logger.h"
#include <boost/unordered_map.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/depth_first_search.hpp>
#include <boost/graph/properties.hpp>
#include <boost/scoped_ptr.hpp>
Go to the source code of this file.
Data Structures | |
struct | internal::DFSVisitor |
Namespaces | |
namespace | internal |
Typedefs | |
typedef ComponentGraph::Component | Component |
typedef ComponentGraph::ComponentIterator | ComponentIterator |
typedef std::vector< Component > | ComponentContainer |
typedef ComponentGraph::ComponentSet | ComponentSet |
Functions | |
template<typename ComponentGraph , typename Set > | |
void | internal::transitivePredecessorComponents (const ComponentGraph &compgraph, Component from, Set &preds) |
Implementation of a nontrivial but simple evaluation heuristic.
Definition in file EvalHeuristicEasy.cpp.
typedef ComponentGraph::Component Component |
Definition at line 61 of file EvalHeuristicEasy.cpp.
typedef std::vector<Component> ComponentContainer |
Definition at line 63 of file EvalHeuristicEasy.cpp.
Definition at line 62 of file EvalHeuristicEasy.cpp.
Definition at line 64 of file EvalHeuristicEasy.cpp.