claw::graph< S, A, Comp >::graph_edge_iterator::edge Class Reference

Value pointed by the iterator. More...

#include <graph.hpp>

List of all members.

Public Member Functions

 edge ()
 Constructor.
const edge_typelabel () const
 Gets edge's label.
const vertex_typesource () const
 Gets edge's source.
const vertex_typetarget () const
 Gets edge's target.

Private Member Functions

void set (const edge_type &l, const vertex_type &s, const vertex_type &t)
 Sets label, source and taget.

Private Attributes

edge_type const * m_label
vertex_type const * m_source
vertex_type const * m_target

Friends

class graph_edge_iterator

Detailed Description

template<class S, class A = meta::no_type, class Comp = std::less<S>>
class claw::graph< S, A, Comp >::graph_edge_iterator::edge

Value pointed by the iterator.

Definition at line 151 of file graph.hpp.


Constructor & Destructor Documentation

template<class S , class A , class Comp >
claw::graph< S, A, Comp >::graph_edge_iterator::edge::edge (  )  [inline]

Constructor.

Definition at line 212 of file graph.tpp.

00213   : m_label(NULL), m_source(NULL), m_target(NULL)
00214 {
00215 
00216 } // edge::edge [constructor]


Member Function Documentation

template<class S , class A , class Comp >
const claw::graph< S, A, Comp >::edge_type & claw::graph< S, A, Comp >::graph_edge_iterator::edge::label (  )  const [inline]

Gets edge's label.

Definition at line 224 of file graph.tpp.

References claw::graph< S, A, Comp >::graph_edge_iterator::edge::m_label.

00225 {
00226   assert(m_label != NULL);
00227   return *m_label;
00228 } // edge::label()

template<class S , class A , class Comp >
void claw::graph< S, A, Comp >::graph_edge_iterator::edge::set ( const edge_type l,
const vertex_type s,
const vertex_type t 
) [inline, private]
template<class S , class A , class Comp >
const claw::graph< S, A, Comp >::vertex_type & claw::graph< S, A, Comp >::graph_edge_iterator::edge::source (  )  const [inline]

Gets edge's source.

Definition at line 236 of file graph.tpp.

References claw::graph< S, A, Comp >::graph_edge_iterator::edge::m_source.

00237 {
00238   assert(m_source != NULL);
00239   return *m_source;
00240 } // edge::source()

template<class S , class A , class Comp >
const claw::graph< S, A, Comp >::vertex_type & claw::graph< S, A, Comp >::graph_edge_iterator::edge::target (  )  const [inline]

Gets edge's target.

Definition at line 248 of file graph.tpp.

References claw::graph< S, A, Comp >::graph_edge_iterator::edge::m_target.

00249 {
00250   assert(m_target != NULL);
00251   return *m_target;
00252 } // edge::target()


Friends And Related Function Documentation

template<class S, class A = meta::no_type, class Comp = std::less<S>>
friend class graph_edge_iterator [friend]

Definition at line 153 of file graph.hpp.


Member Data Documentation

template<class S, class A = meta::no_type, class Comp = std::less<S>>
edge_type const* claw::graph< S, A, Comp >::graph_edge_iterator::edge::m_label [private]
template<class S, class A = meta::no_type, class Comp = std::less<S>>
vertex_type const* claw::graph< S, A, Comp >::graph_edge_iterator::edge::m_source [private]
template<class S, class A = meta::no_type, class Comp = std::less<S>>
vertex_type const* claw::graph< S, A, Comp >::graph_edge_iterator::edge::m_target [private]

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

Generated on 9 Nov 2009 for CLAW Library (a C++ Library Absolutely Wonderful) by  doxygen 1.6.1