|
typedef graph< Node, Edge >::adjacency_list | adj_list |
|
typedef edge_iterator | self_type |
|
typedef std::conditional< std::is_same< Iter, typename vec_t::const_iterator >::value, const Edge, Edge >::type | value_type |
|
typedef value_type & | reference |
|
typedef value_type * | pointer |
|
typedef std::forward_iterator_tag | iterator_category |
|
typedef ptrdiff_t | difference_type |
|
|
| edge_iterator (const undirected_graph< Node, Edge > *handle, const Iter &iter, const Iter &end_iter) |
|
| edge_iterator (const directed_graph< Node, Edge > *handle, const Iter &iter, const Iter &end_iter) |
|
void | init (uint64_t num_edges) |
|
self_type | operator++ () |
|
self_type | operator++ (int) |
|
reference | operator* () |
|
pointer | operator-> () |
|
|
Iter | iter_ |
|
std::conditional< std::is_same< Iter, typename vec_t::const_iterator >::value, typename adj_list::const_iterator, typename adj_list::iterator >::type | al_iter_ |
|
bool | end_ |
|
Iter | beg_iter_ |
|
Iter | end_iter_ |
|
bool | is_undirected_ |
|
The documentation for this class was generated from the following file: