Main Page | Namespace List | Class Hierarchy | Class List | File List | Namespace Members | Class Members | File Members | Related Pages

mapFlatAbstraction Class Reference

#include <mapFlatAbstraction.h>

Inheritance diagram for mapFlatAbstraction:

Inheritance graph
[legend]
Collaboration diagram for mapFlatAbstraction:

Collaboration graph
[legend]
List of all members.

Public Member Functions

 mapFlatAbstraction (Map *_m)
 ~mapFlatAbstraction ()
virtual 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 buildConnectivityGroups ()

Private Attributes

bool groupsValid
std::vector< int > groups

Constructor & Destructor Documentation

mapFlatAbstraction::mapFlatAbstraction (  Map *  _m  ) 
 

mapFlatAbstraction::~mapFlatAbstraction (   ) 
 


Member Function Documentation

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

add edge to abstraction

Implements graphAbstraction.

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

add node to abstraction

Implements graphAbstraction.

void mapFlatAbstraction::buildConnectivityGroups (   )  [private]
 

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

return a new abstraction map of the same type as this map abstraction

Implements mapAbstraction.

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

is there a legal path between these 2 nodes?

Implements graphAbstraction.

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

remove edge from abstraction

Implements graphAbstraction.

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

remove node from abstraction

Implements graphAbstraction.

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

verify that the hierarchy is consistent

Implements graphAbstraction.


Member Data Documentation

std::vector<int> mapFlatAbstraction::groups [private]
 

bool mapFlatAbstraction::groupsValid [private]
 


The documentation for this class was generated from the following files:
Generated on Tue Aug 18 03:43:42 2009 for HOG by doxygen 1.3.4