Graph::Astar Class Reference

#include <math/astar.h>

List of all members.

Public Member Functions
std::vector< int >	GetPath () const
void	Search (const GraphBase &g, const int start, const int end)
Protected Member Functions
void	AddToOpenList (const int nodeNumber)
double	GetCost (const int nodeNumber)
int	GetNodeFromOpenList () const
void	MarkNodeCost (const int nodeNumber, const double cost)
bool	OpenListIsEmpty () const
void	ProcessAllNeighborsOfNode (const GraphBase &g, const int node)
void	RemoveNodeFromOpenList (const int nodeNum)
int	SmallestNeighbor (const GraphBase &g, const int node)
Private Attributes
std::set< int >	m_OpenList
std::vector< double >	m_Costs
std::vector< int >	m_Path

---

Detailed Description

Definition at line 17 of file astar.h.

---

Member Function Documentation

void Graph::Astar::AddToOpenList (  const int  nodeNumber  )  [protected]

Definition at line 14 of file astar.cpp. References m_OpenList. Referenced by ProcessAllNeighborsOfNode(), and Search().

double Graph::Astar::GetCost (  const int  nodeNumber  )  [protected]

Definition at line 24 of file astar.cpp. References m_Costs. Referenced by ProcessAllNeighborsOfNode(), and Search().

int Graph::Astar::GetNodeFromOpenList (   )  const [protected]

Definition at line 35 of file astar.cpp. References m_OpenList. Referenced by Search().

std::vector< int > Graph::Astar::GetPath (   )  const

Definition at line 46 of file astar.cpp. References m_Path.

void Graph::Astar::MarkNodeCost (  const int  nodeNumber, const double  cost )  [protected]

Definition at line 56 of file astar.cpp. References m_Costs. Referenced by ProcessAllNeighborsOfNode(), and Search().

bool Graph::Astar::OpenListIsEmpty (   )  const [protected]

Definition at line 66 of file astar.cpp. References m_OpenList. Referenced by Search().

void Graph::Astar::ProcessAllNeighborsOfNode (  const GraphBase &  g, const int  node )  [protected]

Definition at line 77 of file astar.cpp. References AddToOpenList(), GetCost(), Graph::GraphBase::GetNeighbors(), and MarkNodeCost(). Referenced by Search(). Here is the call graph for this function:

void Graph::Astar::RemoveNodeFromOpenList (  const int  nodeNum  )  [protected]

Definition at line 101 of file astar.cpp. References m_OpenList. Referenced by Search().

void Graph::Astar::Search (  const GraphBase &  g, const int  start, const int  end )

Definition at line 111 of file astar.cpp. References AddToOpenList(), GetCost(), GetNodeFromOpenList(), Graph::GraphBase::GetNumNodes(), IJG_Assert, m_Costs, m_Path, MarkNodeCost(), OpenListIsEmpty(), ProcessAllNeighborsOfNode(), RemoveNodeFromOpenList(), and SmallestNeighbor(). Here is the call graph for this function:

int Graph::Astar::SmallestNeighbor (  const GraphBase &  g, const int  node )  [protected]

Definition at line 170 of file astar.cpp. References Graph::GraphBase::GetNeighbors(), and m_Costs. Referenced by Search(). Here is the call graph for this function:

---

Member Data Documentation

std::vector< double > Graph::Astar::m_Costs [private]

Definition at line 33 of file astar.h. Referenced by GetCost(), MarkNodeCost(), Search(), and SmallestNeighbor().

std::set< int > Graph::Astar::m_OpenList [private]

Definition at line 32 of file astar.h. Referenced by AddToOpenList(), GetNodeFromOpenList(), OpenListIsEmpty(), and RemoveNodeFromOpenList().

std::vector< int > Graph::Astar::m_Path [private]

Definition at line 34 of file astar.h. Referenced by GetPath(), and Search().

---

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

• math/astar.h
• math/astar.cpp

---