#include "MapAbstraction.h"#include "Graph.h"#include "Path.h"#include <unordered_map>#include <vector>
Include dependency graph for ClusterAbstraction.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Classes | |
| struct | clusterUtil::EdgeEqual |
| struct | clusterUtil::EdgeHash |
| class | Cluster |
| class | Entrance |
| class | ClusterAbstraction |
| Cluster abstraction for HPA* algorithm as described in (Botea,Mueller,Schaeffer 2004). More... | |
Namespaces | |
| clusterUtil | |
Typedefs | |
| typedef std::unordered_map< edge *, path *, clusterUtil::EdgeHash, clusterUtil::EdgeEqual > | clusterUtil::PathLookupTable |
Enumerations | |
| enum | Orientation { HORIZONTAL, VERTICAL } |
Variables | |
| const int | MAX_ENTRANCE_WIDTH = 6 |
Enumeration Type Documentation
◆ Orientation
| enum Orientation |
| Enumerator | |
|---|---|
| HORIZONTAL | |
| VERTICAL | |
Definition at line 22 of file ClusterAbstraction.h.
Variable Documentation
◆ MAX_ENTRANCE_WIDTH
| const int MAX_ENTRANCE_WIDTH = 6 |
Definition at line 24 of file ClusterAbstraction.h.
Referenced by ClusterAbstraction::createHorizEntrances(), and ClusterAbstraction::createVertEntrances().
