#include <lemon/concept/sym_graph.h>
Inheritance diagram for StaticSymGraph::SymEdge:
Definition at line 160 of file sym_graph.h.
Public Member Functions | |
SymEdge () | |
Default constructor. | |
SymEdge (const SymEdge &) | |
Copy constructor. | |
SymEdge (Invalid) | |
Initialize the iterator to be invalid. | |
bool | operator== (SymEdge) const |
Equality operator. | |
bool | operator!= (SymEdge) const |
Inequality operator. | |
bool | operator< (SymEdge) const |
Comparison operator. |
|
Definition at line 166 of file sym_graph.h. |
|
Copy constructor. Definition at line 171 of file sym_graph.h. |
|
Initialize the iterator to be invalid. Definition at line 176 of file sym_graph.h. |
|
Two iterators are equal if and only if they point to the same object or both are invalid. Definition at line 181 of file sym_graph.h. |
|
Definition at line 186 of file sym_graph.h. |
|
This is a strict ordering between the nodes. This ordering can be different from the order in which NodeIt goes through the nodes.
Definition at line 194 of file sym_graph.h. |