Go to the documentation of this file.
21 RoadMap(
const char *graph,
const char *coordinates,
bool time);
42 std::string
GetName() {
return std::string(
"RoadMap"); }
43 virtual void SetColor(GLfloat rr, GLfloat
g, GLfloat b, GLfloat t = 1.0)
const;
44 virtual void GetColor(GLfloat& rr, GLfloat&
g, GLfloat& b, GLfloat &t)
const;
48 virtual void GLDrawPath(
const std::vector<intersection> &x)
const;
virtual uint64_t GetActionHash(neighbor act) const
virtual void GLDrawPath(const std::vector< intersection > &x) const
virtual void GetSuccessors(const intersection &nodeID, std::vector< intersection > &neighbors) const
virtual double GCost(const intersection &node1, const intersection &node2) const
virtual bool GoalTest(const intersection &node, const intersection &goal) const
virtual double HCost(const intersection &node1, const intersection &node2) const
Heuristic value between two arbitrary nodes.
virtual void ApplyAction(intersection &s, neighbor a) const
virtual neighbor GetAction(const intersection &s1, const intersection &s2) const
virtual void SetColor(GLfloat rr, GLfloat g, GLfloat b, GLfloat t=1.0) const
virtual void GetStateFromHash(uint64_t parent, intersection &s) const
virtual void OpenGLDraw() const
virtual rgbColor GetColor() const
virtual uint64_t GetMaxHash() const
virtual uint64_t GetStateHash(const intersection &node) const
virtual bool InvertAction(neighbor &a) const
virtual void GetActions(const intersection &nodeID, std::vector< neighbor > &actions) const
Nodes to be stored within a Graph.
RoadMap(const char *graph, const char *coordinates, bool time)