![]() |
abLEMON 1.9.0-101-gccb8629
A maintained fork of LEMON
|
Iterator class for the nodes. More...
#include <lemon/concepts/graph.h>
Public Member Functions | |
| NodeIt () | |
| Default constructor. | |
| NodeIt (const NodeIt &n) | |
| Copy constructor. | |
| const NodeIt & | operator= (const NodeIt &) |
| Assignment operator. | |
| NodeIt (Invalid) | |
| Invalid constructor & conversion. | |
| NodeIt (const Graph &) | |
| Sets the iterator to the first node. | |
| NodeIt (const Graph &, const Node &) | |
| Sets the iterator to the given node. | |
| NodeIt & | operator++ () |
| Next node. | |
| Public Member Functions inherited from Graph::Node | |
| Node () | |
| Default constructor. | |
| Node (const Node &) | |
| Copy constructor. | |
| const Node & | operator= (const Node &) |
| Assignment operator. | |
| Node (Invalid) | |
| Invalid constructor & conversion. | |
| bool | operator== (Node) const |
| Equality operator. | |
| bool | operator!= (Node) const |
| Inequality operator. | |
| bool | operator< (Node) const |
| Artificial ordering operator. | |
This iterator goes through each node of the graph. Its usage is quite simple, for example, you can count the number of nodes in a graph g of type Graph like this:
|
inline |
Default constructor.
|
inline |
Copy constructor.
|
inlineexplicit |
Sets the iterator to the first node of the given digraph.
Sets the iterator to the given node of the given digraph.
|
inline |
Assign the iterator to the next node.