#include <vector>
#include <queue>
#include <tr1/unordered_map>
#include "heuristic.h"
#include "state.h"
#include "domain_transition_graph.h"
#include <ext/slist>
#include <cmath>
#include <stdlib.h>
#include <sstream>
#include <string>
#include <tr1/tuple>
#include "operator.h"
Go to the source code of this file.
Classes | |
class | CyclicCGHeuristic |
class | LocalProblem |
class | LocalProblemComp |
class | LocalProblemDiscrete |
class | LocalProblemNode |
class | LocalProblemNodeComp |
class | LocalProblemNodeDiscrete |
class | LocalTransition |
class | LocalTransitionComp |
class | LocalTransitionDiscrete |
class | Node_compare |
Typedefs | |
typedef pair< int, int > | CausalConstraint |
typedef waiting_list_t::const_iterator | const_it_waiting_list |
typedef std::tr1::unordered_map< int, int > | hashmap |
typedef waiting_list_t::iterator | it_waiting_list |
typedef priority_queue < LocalProblemNode *, std::vector < LocalProblemNode * > , Node_compare > | node_queue |
typedef tr1::tuple< const Operator *, double, int > | TimedOp |
typedef hashmap::value_type | ValuePair |
typedef __gnu_cxx::slist < std::pair< LocalTransition *, int > > | waiting_list_t |
typedef pair<int, int> CausalConstraint |
Definition at line 120 of file cyclic_cg_heuristic.h.
typedef waiting_list_t::const_iterator const_it_waiting_list |
Definition at line 38 of file cyclic_cg_heuristic.h.
typedef std::tr1::unordered_map<int, int> hashmap |
Definition at line 41 of file cyclic_cg_heuristic.h.
typedef waiting_list_t::iterator it_waiting_list |
Definition at line 39 of file cyclic_cg_heuristic.h.
typedef priority_queue<LocalProblemNode*, std::vector<LocalProblemNode*>, Node_compare> node_queue |
Definition at line 32 of file cyclic_cg_heuristic.h.
Definition at line 121 of file cyclic_cg_heuristic.h.
typedef hashmap::value_type ValuePair |
Definition at line 42 of file cyclic_cg_heuristic.h.
typedef __gnu_cxx ::slist<std::pair<LocalTransition*, int> > waiting_list_t |
Definition at line 37 of file cyclic_cg_heuristic.h.