#include <lemon/concept/sym_graph.h>
Inheritance diagram for StaticSymGraph::Edge:
Definition at line 202 of file sym_graph.h.
Public Member Functions | |
Edge () | |
Default constructor. | |
Edge (const Edge &) | |
Copy constructor. | |
Edge (Invalid) | |
Initialize the iterator to be invalid. | |
bool | operator== (Edge) const |
Equality operator. | |
bool | operator!= (Edge) const |
Inequality operator. | |
bool | operator< (Edge) const |
Comparison operator. |
|
Definition at line 208 of file sym_graph.h. |
|
Copy constructor. Definition at line 213 of file sym_graph.h. |
|
Initialize the iterator to be invalid. Definition at line 218 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 223 of file sym_graph.h. |
|
Definition at line 228 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 236 of file sym_graph.h. |