cajun::graph_t< ID_T >::vertex_t Class Reference

#include <graph.H>

List of all members.

Public Member Functions
ID_T const &	id () const
edge_t *	add_edge (vertex_t *dst_, double cost_)
unsigned	num_edges () const
edge_t *	edge (unsigned i) const
edge_t *	add_back_edge (vertex_t *dst_, double cost_)
unsigned	num_back_edges () const
edge_t *	back_edge (unsigned i) const
bool	operator== (vertex_t const &v_) const
void	set_cost (unsigned edge_id_, double cost_)
Private Member Functions
	vertex_t (ID_T id_)
Private Attributes
ID_T	m_id
std::vector< edge_t * >	m_edges
std::vector< edge_t * >	m_back_edges
Friends
class	graph_t

template<typename ID_T>
class cajun::graph_t< ID_T >::vertex_t

---

Constructor & Destructor Documentation

template<typename ID_T>

cajun::graph_t< ID_T >::vertex_t::vertex_t

(

ID_T

id_

)

[inline, private]

---

Member Function Documentation

template<typename ID_T>

edge_t* cajun::graph_t< ID_T >::vertex_t::add_back_edge	(	vertex_t *	dst_,
		double	cost_
	)			[inline]

References cajun::graph_t< ID_T >::vertex_t::edge(), and cajun::graph_t< ID_T >::vertex_t::m_back_edges.

template<typename ID_T>

edge_t* cajun::graph_t< ID_T >::vertex_t::add_edge	(	vertex_t *	dst_,
		double	cost_
	)			[inline]

References cajun::graph_t< ID_T >::vertex_t::edge(), and cajun::graph_t< ID_T >::vertex_t::m_edges.

template<typename ID_T>

edge_t* cajun::graph_t< ID_T >::vertex_t::back_edge

(

unsigned

i

)

const [inline]

References cajun::graph_t< ID_T >::vertex_t::m_back_edges.

template<typename ID_T>

edge_t* cajun::graph_t< ID_T >::vertex_t::edge

(

unsigned

i

)

const [inline]

References cajun::graph_t< ID_T >::vertex_t::m_edges.

Referenced by cajun::graph_t< ID_T >::vertex_t::add_back_edge(), cajun::graph_t< ID_T >::vertex_t::add_edge(), and cajun::graph_search_t< rp_containter_t >::search_graph().

template<typename ID_T>

ID_T const& cajun::graph_t< ID_T >::vertex_t::id

(

)

const [inline]

References cajun::graph_t< ID_T >::vertex_t::m_id.

Referenced by cajun::graph_t< ID_T >::vertex_t::operator==().

template<typename ID_T>

unsigned cajun::graph_t< ID_T >::vertex_t::num_back_edges

(

)

const [inline]

References cajun::graph_t< ID_T >::vertex_t::m_back_edges.

template<typename ID_T>

unsigned cajun::graph_t< ID_T >::vertex_t::num_edges

(

)

const [inline]

References cajun::graph_t< ID_T >::vertex_t::m_edges.

Referenced by cajun::graph_search_t< rp_containter_t >::search_graph().

template<typename ID_T>

bool cajun::graph_t< ID_T >::vertex_t::operator==

(

vertex_t const &

v_

)

const [inline]

References cajun::graph_t< ID_T >::vertex_t::id(), and cajun::graph_t< ID_T >::vertex_t::m_id.

template<typename ID_T>

void cajun::graph_t< ID_T >::vertex_t::set_cost	(	unsigned	edge_id_,
		double	cost_
	)			[inline]

References cajun::graph_t< ID_T >::vertex_t::m_edges.

---

Friends And Related Function Documentation

template<typename ID_T>

friend class graph_t [friend]

---

Member Data Documentation

template<typename ID_T>

std::vector<edge_t *> cajun::graph_t< ID_T >::vertex_t::m_back_edges [private]

Referenced by cajun::graph_t< ID_T >::vertex_t::add_back_edge(), cajun::graph_t< ID_T >::vertex_t::back_edge(), and cajun::graph_t< ID_T >::vertex_t::num_back_edges().

template<typename ID_T>

std::vector<edge_t *> cajun::graph_t< ID_T >::vertex_t::m_edges [private]

Referenced by cajun::graph_t< ID_T >::vertex_t::add_edge(), cajun::graph_t< ID_T >::vertex_t::edge(), cajun::graph_t< ID_T >::vertex_t::num_edges(), and cajun::graph_t< ID_T >::vertex_t::set_cost().

template<typename ID_T>

ID_T cajun::graph_t< ID_T >::vertex_t::m_id [private]

Referenced by cajun::graph_t< ID_T >::vertex_t::id(), and cajun::graph_t< ID_T >::vertex_t::operator==().

---

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

• graph.H