cajun::graph_search_t< ID_T >::search_node_t Class Reference

Search node to keep track of graph's nodes. More...

List of all members.

Public Member Functions
bool	operator< (search_node_t const &sn_) const
bool	operator== (search_node_t const &sn_) const
	search_node_t (typename graph_t< ID_T >::vertex_t const *g_node_)
double	get_cost ()
void	set_cost (double new_cost)
Public Attributes
graph_t< ID_T >::vertex_t const *	g_node
double	m_cost
search_node_t *	prev_s_node

---

Detailed Description

template<typename ID_T>
class cajun::graph_search_t< ID_T >::search_node_t

Search node to keep track of graph's nodes.

---

Constructor & Destructor Documentation

template<typename ID_T>

cajun::graph_search_t< ID_T >::search_node_t::search_node_t

(

typename graph_t< ID_T >::vertex_t const *

g_node_

)

[inline]

---

Member Function Documentation

template<typename ID_T>

double cajun::graph_search_t< ID_T >::search_node_t::get_cost

(

)

[inline]

References cajun::graph_search_t< ID_T >::search_node_t::m_cost.

template<typename ID_T>

bool cajun::graph_search_t< ID_T >::search_node_t::operator<

(

search_node_t const &

sn_

)

const [inline]

References cajun::graph_search_t< ID_T >::search_node_t::m_cost.

template<typename ID_T>

bool cajun::graph_search_t< ID_T >::search_node_t::operator==

(

search_node_t const &

sn_

)

const [inline]

References cajun::graph_search_t< ID_T >::search_node_t::g_node.

template<typename ID_T>

void cajun::graph_search_t< ID_T >::search_node_t::set_cost

(

double

new_cost

)

[inline]

References cajun::graph_search_t< ID_T >::search_node_t::m_cost.

---

Member Data Documentation

template<typename ID_T>

graph_t<ID_T>::vertex_t const* cajun::graph_search_t< ID_T >::search_node_t::g_node

Referenced by cajun::graph_search_t< ID_T >::search_node_t::operator==().

template<typename ID_T>

double cajun::graph_search_t< ID_T >::search_node_t::m_cost

Referenced by cajun::graph_search_t< ID_T >::search_node_t::get_cost(), cajun::graph_search_t< ID_T >::search_node_t::operator<(), and cajun::graph_search_t< ID_T >::search_node_t::set_cost().

template<typename ID_T>

search_node_t* cajun::graph_search_t< ID_T >::search_node_t::prev_s_node

---

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

• graph_search.H