HOG2
|
#include "SearchAlgorithm.h"
#include "OpenClosedList.h"
#include "FPUtil.h"
#include "Graph.h"
#include "GraphAbstraction.h"
#include <unordered_map>
Go to the source code of this file.
Classes | |
struct | CFOptimalRefinementConstants::GNode |
struct | CFOptimalRefinementConstants::NodeEqual |
struct | CFOptimalRefinementConstants::NodeCompare |
struct | CFOptimalRefinementConstants::NodeHash |
class | CFOptimalRefinement |
Namespaces | |
CFOptimalRefinementConstants | |
Typedefs | |
typedef OpenClosedList< CFOptimalRefinementConstants::GNode, CFOptimalRefinementConstants::NodeHash, CFOptimalRefinementConstants::NodeEqual, CFOptimalRefinementConstants::NodeCompare > | PQueue |
typedef std::unordered_map< uint32_t, CFOptimalRefinementConstants::GNode > | NodeLookupTable |
Enumerations | |
enum | { CFOptimalRefinementConstants::kAbstractionLevel = 0, CFOptimalRefinementConstants::kCorrespondingNode = 1, CFOptimalRefinementConstants::kGCost = 2, CFOptimalRefinementConstants::kHCost = 3, CFOptimalRefinementConstants::kOptimalFlag = 4, CFOptimalRefinementConstants::kInOpenList = 5 } |
Definitions for node labels. More... | |
typedef std::unordered_map<uint32_t, CFOptimalRefinementConstants::GNode> NodeLookupTable |
Definition at line 84 of file CFOptimalRefinement.h.