CLAW Library (a C++ Library Absolutely Wonderful) 1.5.5
|
Value pointed by the iterator. More...
#include <graph.hpp>
Public Member Functions | |
edge () | |
Constructor. | |
const edge_type & | label () const |
Gets edge's label. | |
const vertex_type & | source () const |
Gets edge's source. | |
const vertex_type & | target () 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 |
Value pointed by the iterator.
claw::graph< S, A, Comp >::graph_edge_iterator::edge::edge | ( | ) |
const claw::graph< S, A, Comp >::edge_type & claw::graph< S, A, Comp >::graph_edge_iterator::edge::label | ( | ) | const |
void claw::graph< S, A, Comp >::graph_edge_iterator::edge::set | ( | const edge_type & | l, |
const vertex_type & | s, | ||
const vertex_type & | t | ||
) | [private] |
Sets label, source and taget.
Definition at line 260 of file graph.tpp.
Referenced by claw::graph< S, A, Comp >::graph_edge_iterator::graph_edge_iterator(), claw::graph< S, A, Comp >::graph_edge_iterator::operator++(), and claw::graph< S, A, Comp >::graph_edge_iterator::operator--().
const claw::graph< S, A, Comp >::vertex_type & claw::graph< S, A, Comp >::graph_edge_iterator::edge::source | ( | ) | const |
const claw::graph< S, A, Comp >::vertex_type & claw::graph< S, A, Comp >::graph_edge_iterator::edge::target | ( | ) | const |
friend class graph_edge_iterator [friend] |
edge_type const* claw::graph< S, A, Comp >::graph_edge_iterator::edge::m_label [private] |
vertex_type const* claw::graph< S, A, Comp >::graph_edge_iterator::edge::m_source [private] |
vertex_type const* claw::graph< S, A, Comp >::graph_edge_iterator::edge::m_target [private] |