HOG2
|
#include "SearchEnvironment.h"
#include "UnitSimulation.h"
#include "Graph.h"
#include "GLUtil.h"
#include <iostream>
#include <stdint.h>
#include <unordered_map>
#include <functional>
Go to the source code of this file.
Classes | |
class | graphMove |
class | GraphHeuristic |
class | GraphHeuristicContainer |
class | GraphLabelHeuristic |
class | GraphMapHeuristic |
class | GraphMapPerfectHeuristic |
class | GraphDistanceHeuristic |
class | GraphMapInconsistentHeuristic |
class | GraphEnvironment |
Namespaces | |
GraphSearchConstants | |
Macros | |
#define | UINT32_MAX 4294967295U |
#define | UINT16_MAX 65535 |
Typedefs | |
typedef unsigned long | graphState |
typedef UnitSimulation< graphState, graphMove, GraphEnvironment > | GraphSimulation |
Enumerations | |
enum | { GraphSearchConstants::kHCost = 0, GraphSearchConstants::kXCoordinate = 5, GraphSearchConstants::kYCoordinate = 6, GraphSearchConstants::kZCoordinate = 7, GraphSearchConstants::kTemporaryLabel = 8, GraphSearchConstants::kMapX = 9, GraphSearchConstants::kMapY = 10, GraphSearchConstants::kFirstData = 11 } |
enum | placementScheme { kFarPlacement, kRandomPlacement, kAvoidPlacement } |
enum | tHeuristicCombination { kIgnore = 0, kRandom = 1, kMax = 2, kGridMax = 3, kCompressed = 4 } |
Functions | |
static bool | operator== (const graphMove &l1, const graphMove &l2) |
Graph * | GraphSearchConstants::GetEightConnectedGraph (Map *m, bool directed) |
Graph * | GraphSearchConstants::GetFourConnectedGraph (Map *m, bool directed) |
Graph * | GraphSearchConstants::GetGraph (Map *m) |
Graph * | GraphSearchConstants::GetUndirectedGraph (Map *m) |
GetMapGraph(map) More... | |
void | GraphSearchConstants::AddNodesToGraph (Map *m, Graph *g) |
void | GraphSearchConstants::AddEdges (Map *m, Graph *g, int x, int y, bool directed, double straigtEdgeCost, double diagEdgeCost, int straightEdgeProb, int diagEdgeProb) |
AddEdges(map, Graph, x, y) More... | |
Variables | |
const double | GraphSearchConstants::kStraightEdgeCost = 1.0 |
const double | GraphSearchConstants::kDiagonalEdgeCost = ROOT_TWO |
#define UINT16_MAX 65535 |
Definition at line 29 of file GraphEnvironment.h.
#define UINT32_MAX 4294967295U |
Definition at line 26 of file GraphEnvironment.h.
Definition at line 385 of file GraphEnvironment.h.
typedef unsigned long graphState |
Definition at line 32 of file GraphEnvironment.h.
enum placementScheme |
Enumerator | |
---|---|
kFarPlacement | |
kRandomPlacement | |
kAvoidPlacement |
Definition at line 216 of file GraphEnvironment.h.
Enumerator | |
---|---|
kIgnore | |
kRandom | |
kMax | |
kGridMax | |
kCompressed |
Definition at line 254 of file GraphEnvironment.h.
Definition at line 42 of file GraphEnvironment.h.
References graphMove::from, and graphMove::to.