graphgen::undirected_graph::ineighbors Class Reference
Iterator over the neighbors of a start node. More...
#include <iterator.hpp>
Collaboration diagram for graphgen::undirected_graph::ineighbors:
Public Member Functions | |
| ineighbors (const undirected_graph &g, vertex_type v) | |
| construct a neighborhood-of-v iterator for graph g | |
| vertex_type | operator* () const |
| dereference returns the vertex identifier fo the actual vertex | |
| ineighbors & | operator++ () |
| advance to the next neighbor of v | |
| bool | operator== (const ineighbors &rhs) |
| comparison of iterators returns true, when both point to the same vertex in the same graph object | |
| link_type | via () const |
| return the identifier of the edge linking v and the actual vertex | |
| bool | valid () const |
| tests the validity of the iterator. | |
Detailed Description
Iterator over the neighbors of a start node.Use via() to determine the link that led to the dereferenced vertex
Member Function Documentation
| bool graphgen::undirected_graph::ineighbors::valid | ( | ) | const [inline] |
tests the validity of the iterator.
Use this to avoid vertex range violation.
Referenced by graphgen::estimate_clustering_coeff_local().
The documentation for this class was generated from the following file:
