andres::graph
|
Return 1 for every edge. More...
#include <edge-value.hxx>
Public Types | |
typedef std::ptrdiff_t | difference_type |
typedef T | value_type |
typedef value_type * | pointer |
typedef value_type & | reference |
typedef std::random_access_iterator_tag | iterator_category |
Public Member Functions | |
value_type | operator[] (const std::size_t) const |
Return 1 for every edge.
Definition at line 10 of file edge-value.hxx.
typedef std::ptrdiff_t andres::graph::UnitEdgeValueIterator< T >::difference_type |
Definition at line 11 of file edge-value.hxx.
typedef std::random_access_iterator_tag andres::graph::UnitEdgeValueIterator< T >::iterator_category |
Definition at line 15 of file edge-value.hxx.
typedef value_type* andres::graph::UnitEdgeValueIterator< T >::pointer |
Definition at line 13 of file edge-value.hxx.
typedef value_type& andres::graph::UnitEdgeValueIterator< T >::reference |
Definition at line 14 of file edge-value.hxx.
typedef T andres::graph::UnitEdgeValueIterator< T >::value_type |
Definition at line 12 of file edge-value.hxx.
|
inline |
Definition at line 17 of file edge-value.hxx.