aStar Class Reference

#include <aStar.h>

Inheritance diagram for aStar:

[legend]Collaboration diagram for aStar:

[legend]List of all members.

Public Member Functions
	aStar ()
virtual	~aStar ()
path *	getPath (graphAbstraction *aMap, node *from, node *to, reservationProvider *rp=0)
virtual const char *	getName ()
double	getHVal (node *whence)
void	setCorridor (path *corridor, int width)
void	printStats ()
long	getNodesExpanded ()
long	getNodesTouched ()
void	resetNodeCount ()
int	getMemoryUsage ()
Private Member Functions
node *	ABSNode (node *n)
path *	getPathToNode (node *target)
path *	extractPathToStart (graph *g, node *n)
node *	getNextNode ()
void	updateWeight (node *currOpenNode, node *neighbor, edge *e)
void	addToOpenList (node *currOpenNode, node *neighbor, edge *e)
bool	nodeInCorridor (node *n)
void	addNeighborsToCorridor (graph *g, node *n, int windowSize)
void	buildCorridor (path *p, int windowSize)
double	internalHeuristic (node *from, node *to)
Private Attributes
AStar3Util::PQueue	openQueue
AStar3Util::NodeLookupTable	openList
AStar3Util::NodeLookupTable	closedList
node *	goal
node *	start
graph *	g
graphAbstraction *	abstr
AStar3Util::Corridor	eligibleNodes
int	absLevel

---

Constructor & Destructor Documentation

aStar::aStar (   )  [inline]

virtual aStar::~aStar (   )  [inline, virtual]

---

Member Function Documentation

node* aStar::ABSNode (  node *  n  )  [inline, private]

void aStar::addNeighborsToCorridor (  graph *  g, node *  n, int  windowSize )  [private]

void aStar::addToOpenList (  node *  currOpenNode, node *  neighbor, edge *  e )  [private]

void aStar::buildCorridor (  path *  p, int  windowSize )  [private]

path * aStar::extractPathToStart (  graph *  g, node *  n )  [private]

double aStar::getHVal (  node *  whence  )

int aStar::getMemoryUsage (   )

const char * aStar::getName (   )  [virtual]

Implements searchAlgorithm.

node * aStar::getNextNode (   )  [private]

long aStar::getNodesExpanded (   )  [inline]

Reimplemented from searchAlgorithm.

long aStar::getNodesTouched (   )  [inline]

Reimplemented from searchAlgorithm.

path * aStar::getPath (  graphAbstraction *  aMap, node *  from, node *  to, reservationProvider *  rp = 0 )  [virtual]

Implements searchAlgorithm.

path * aStar::getPathToNode (  node *  target  )  [private]

double aStar::internalHeuristic (  node *  from, node *  to )  [private]

bool aStar::nodeInCorridor (  node *  n  )  [private]

void aStar::printStats (   )

void aStar::resetNodeCount (   )  [inline]

void aStar::setCorridor (  path *  corridor, int  width )

void aStar::updateWeight (  node *  currOpenNode, node *  neighbor, edge *  e )  [private]

---

Member Data Documentation

int aStar::absLevel [private]

graphAbstraction* aStar::abstr [private]

AStar3Util::NodeLookupTable aStar::closedList [private]

AStar3Util::Corridor aStar::eligibleNodes [private]

graph* aStar::g [private]

node* aStar::goal [private]

AStar3Util::NodeLookupTable aStar::openList [private]

AStar3Util::PQueue aStar::openQueue [private]

node * aStar::start [private]

---

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

• /shared/aStar.h
• /shared/aStar.cpp

---