|
dlvhex
2.1.0
|
Implementation of a nontrivial but simple evaluation heuristic. More...
#include "dlvhex2/EvalHeuristicEasy.h"#include "dlvhex2/Logger.h"#include <boost/unordered_map.hpp>#include <boost/property_map/property_map.hpp>#include <boost/graph/topological_sort.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 |
| typedef std::map< Component, std::list< Component > > | internal::Cloned2OrigMap |
Functions | |
| template<typename ComponentGraph , typename Sequence > | |
| void | internal::topologicalSortOfComponents (const ComponentGraph &compgraph, Sequence &comps) |
| template<typename ComponentGraph , typename Set > | |
| void | internal::transitivePredecessorComponents (const ComponentGraph &compgraph, Component from, Set &preds) |
| Component | internal::collapseHelper (Cloned2OrigMap &com, ComponentGraph &clonedcg, const ComponentSet &clonedcollapse) |
Implementation of a nontrivial but simple evaluation heuristic.
Definition in file EvalHeuristicEasy.cpp.
| typedef ComponentGraph::Component Component |
Definition at line 56 of file EvalHeuristicEasy.cpp.
| typedef std::vector<Component> ComponentContainer |
Definition at line 58 of file EvalHeuristicEasy.cpp.
Definition at line 57 of file EvalHeuristicEasy.cpp.
Definition at line 59 of file EvalHeuristicEasy.cpp.