NodeLimitAbstraction Class Reference

#include <NodeLimitAbstraction.h>

Inheritance diagram for NodeLimitAbstraction:

[legend]Collaboration diagram for NodeLimitAbstraction:

[legend]List of all members.

Public Member Functions
	NodeLimitAbstraction (Map *, int nodeLimit)
	~NodeLimitAbstraction ()
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	nodeLimit

---

Constructor & Destructor Documentation

NodeLimitAbstraction::NodeLimitAbstraction (  Map *  , int  nodeLimit )

NodeLimitAbstraction::~NodeLimitAbstraction (   )

---

Member Function Documentation

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

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

add edge to abstraction Implements graphAbstraction.

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

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

add node to abstraction Implements graphAbstraction.

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

void NodeLimitAbstraction::buildAbstraction (   )  [private]

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

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

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

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

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

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

remove edge from abstraction Implements graphAbstraction.

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

remove node from abstraction Implements graphAbstraction.

void NodeLimitAbstraction::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 NodeLimitAbstraction::verifyHierarchy (   )  [virtual]

verify that the hierarchy is consistent Implements graphAbstraction.

---

Member Data Documentation

int NodeLimitAbstraction::nodeLimit [private]

---

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

• /abstraction/NodeLimitAbstraction.h
• /abstraction/NodeLimitAbstraction.cpp

---