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

#include <graph.hpp>

List of all members.


Detailed Description

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

Value pointed by the iterator.

Definition at line 159 of file graph.hpp.


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

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 228 of file graph.tpp.

00229   : m_label(NULL), m_source(NULL), m_target(NULL)
00230 {
00231 
00232 } // 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 240 of file graph.tpp.

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

00241 {
00242   assert(m_label != NULL);
00243   return *m_label;
00244 } // edge::label()

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 252 of file graph.tpp.

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

00253 {
00254   assert(m_source != NULL);
00255   return *m_source;
00256 } // 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 264 of file graph.tpp.

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

00265 {
00266   assert(m_target != NULL);
00267   return *m_target;
00268 } // edge::target()

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]


Friends And Related Function Documentation

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

Definition at line 161 of file graph.hpp.


Member Data Documentation

template<class S, class A, 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, 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, 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 Thu Jun 26 09:35:05 2008 for CLAW Library (a C++ Library Absolutely Wonderful) by  doxygen 1.5.6