#include <lemon/concept/undir_graph.h>
Inherited by UndirGraph::Edge, UndirGraph::IncEdgeIt, UndirGraph::UndirEdgeIt, and UndirGraphEdge.
Inheritance diagram for UndirGraph::UndirEdge:
Public Member Functions | |
UndirEdge () | |
Default constructor. | |
UndirEdge (const UndirEdge &) | |
Copy constructor. | |
UndirEdge (Invalid) | |
Initialize the iterator to be invalid. | |
bool | operator== (UndirEdge) const |
Equality operator. | |
bool | operator!= (UndirEdge) const |
Inequality operator. | |
bool | operator< (UndirEdge) const |
Artificial ordering operator. |
|
|
|
Copy constructor. |
|
Initialize the iterator to be invalid. |
|
Two iterators are equal if and only if they point to the same object or both are invalid. |
|
|
|
To allow the use of graph descriptors as key type in std::map or similar associative container we require this.
|