radiusAbstraction Class Reference

#include <radiusAbstraction.h>

Inheritance diagram for radiusAbstraction:

[legend]Collaboration diagram for radiusAbstraction:

[legend]List of all members.

Public Member Functions
	radiusAbstraction (Map *, int)
	~radiusAbstraction ()
mapAbstraction *	clone (Map *_m)
	return a new abstraction map of the same type as this map abstraction
virtual bool	pathable (node *from, node *to)
	is there a legal path between these 2 nodes?
virtual void	verifyHierarchy ()
	verify that the hierarchy is consistent
virtual void	removeNode (node *n)
	remove node from abstraction
virtual void	removeEdge (edge *e, unsigned int absLevel)
	remove edge from abstraction
virtual void	addNode (node *n)
	add node to abstraction
virtual void	addEdge (edge *e, unsigned int absLevel)
	add edge to abstraction
virtual void	repairAbstraction ()
	This must be called after any of the above add/remove operations.
Private Member Functions
void	buildAbstraction ()
void	buildNodeIntoParent (node *n, node *parent)
void	abstractionBFS (node *which, node *parent, int depth)
void	addEdges (graph *g)
void	addNodes (graph *g)
Private Attributes
int	radius

---

Constructor & Destructor Documentation

radiusAbstraction::radiusAbstraction (  Map *  , int  )

radiusAbstraction::~radiusAbstraction (   )

---

Member Function Documentation

void radiusAbstraction::abstractionBFS (  node *  which, node *  parent, int  depth )  [private]

void radiusAbstraction::addEdge (  edge *  e, unsigned int  absLevel )  [virtual]

add edge to abstraction Implements graphAbstraction.

void radiusAbstraction::addEdges (  graph *  g  )  [private]

void radiusAbstraction::addNode (  node *  n  )  [virtual]

add node to abstraction Implements graphAbstraction.

void radiusAbstraction::addNodes (  graph *  g  )  [private]

void radiusAbstraction::buildAbstraction (   )  [private]

void radiusAbstraction::buildNodeIntoParent (  node *  n, node *  parent )  [private]

mapAbstraction* radiusAbstraction::clone (  Map *  _m  )  [inline, virtual]

return a new abstraction map of the same type as this map abstraction Implements mapAbstraction.

bool radiusAbstraction::pathable (  node *  from, node *  to )  [virtual]

is there a legal path between these 2 nodes? Implements graphAbstraction.

void radiusAbstraction::removeEdge (  edge *  e, unsigned int  absLevel )  [virtual]

remove edge from abstraction Implements graphAbstraction.

void radiusAbstraction::removeNode (  node *  n  )  [virtual]

remove node from abstraction Implements graphAbstraction.

void radiusAbstraction::repairAbstraction (   )  [virtual]

This must be called after any of the above add/remove operations. But the operations can be stacked followed by a single repairAbstraction call. Implements graphAbstraction.

void radiusAbstraction::verifyHierarchy (   )  [virtual]

verify that the hierarchy is consistent Implements graphAbstraction.

---

Member Data Documentation

int radiusAbstraction::radius [private]

---

The documentation for this class was generated from the following files:

• /abstraction/radiusAbstraction.h
• /abstraction/radiusAbstraction.cpp

---