Go to the documentation of this file.
14 #ifndef RADIUSABSTRACTION_H
15 #define RADIUSABSTRACTION_H
37 virtual void AddEdge(
edge *e,
unsigned int absLevel);
virtual void RemoveNode(node *n)
remove node from abstraction
virtual void AddNode(node *n)
add node to abstraction
void buildNodeIntoParent(node *n, node *parent)
virtual bool Pathable(node *from, node *to)
MapAbstraction * Clone(Map *_m)
virtual void VerifyHierarchy()
verify that the hierarchy is consistent
void abstractionBFS(node *which, node *parent, int depth)
virtual void RemoveEdge(edge *e, unsigned int absLevel)
remove edge from abstraction
RadiusAbstraction(Map *, int)
virtual void RepairAbstraction()
This must be called after any of the above add/remove operations.
virtual void AddEdge(edge *e, unsigned int absLevel)
add edge to abstraction
Nodes to be stored within a Graph.
A tile-based representation of the world.
Edge class for connections between node in a Graph.