dlvhex  2.5.0
src/EvalHeuristicGreedy.cpp File Reference

Evaluation heuristic that groups components in as few units as possible. This maximizes the effect of external behavior learning. More...

#include "dlvhex2/EvalHeuristicGreedy.h"
#include "dlvhex2/EvalHeuristicShared.h"
#include "dlvhex2/Logger.h"
#include "dlvhex2/ProgramCtx.h"
#include "dlvhex2/LiberalSafetyChecker.h"
#include <boost/unordered_map.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/breadth_first_search.hpp>
#include <boost/graph/visitors.hpp>
#include <boost/graph/depth_first_search.hpp>
#include <boost/graph/properties.hpp>
#include <boost/scoped_ptr.hpp>
Include dependency graph for EvalHeuristicGreedy.cpp:

Go to the source code of this file.

Data Structures

struct  internalgreedy::DFSVisitor

Namespaces

namespace  internalgreedy

Typedefs

typedef ComponentGraph::Component Component
typedef
ComponentGraph::ComponentIterator 
ComponentIterator
typedef std::vector< ComponentComponentContainer
typedef
ComponentGraph::ComponentSet 
ComponentSet

Functions

template<typename ComponentGraph , typename Set >
void internalgreedy::transitivePredecessorComponents (const ComponentGraph &compgraph, Component from, Set &preds)

Detailed Description

Evaluation heuristic that groups components in as few units as possible. This maximizes the effect of external behavior learning.

Author:
Christoph Redl

Definition in file EvalHeuristicGreedy.cpp.


Typedef Documentation

Definition at line 96 of file EvalHeuristicGreedy.cpp.

typedef std::vector<Component> ComponentContainer

Definition at line 98 of file EvalHeuristicGreedy.cpp.