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