#include <lemon/concept/sym_graph.h>
Inheritance diagram for StaticSymGraph::Node:
Definition at line 70 of file sym_graph.h.
Public Member Functions | |
Node () | |
Default constructor. | |
Node (const Node &) | |
Copy constructor. | |
Node (Invalid) | |
Invalid constructor & conversion. | |
bool | operator== (Node) const |
Equality operator. | |
bool | operator!= (Node) const |
Inequality operator. | |
bool | operator< (Node) const |
Comparison operator. |
|
Definition at line 76 of file sym_graph.h. |
|
Copy constructor. Definition at line 81 of file sym_graph.h. |
|
This constructor initializes the iterator to be invalid.
Definition at line 87 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 92 of file sym_graph.h. |
|
Definition at line 98 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 107 of file sym_graph.h. |