This class describes the concept of Node, Arc and Edge subtypes of digraph and graph types.
Node and Arc (or Edge) types should not derive from the same base class. For Node you should instantiate it with character 'n', for Arc with 'a' and for Edge with 'e'. #include <lemon/concepts/graph_components.h>
Inheritance diagram for GraphItem:Public Member Functions | |
| GraphItem () | |
| Default constructor. More... | |
| GraphItem (const GraphItem &) | |
| Copy constructor. More... | |
| GraphItem (Invalid) | |
Constructor for conversion from INVALID. More... | |
| GraphItem & | operator= (const GraphItem &) |
| Assignment operator. More... | |
| GraphItem & | operator= (Invalid) |
| Assignment operator for INVALID. More... | |
| bool | operator== (const GraphItem &) const |
| Equality operator. More... | |
| bool | operator!= (const GraphItem &) const |
| Inequality operator. More... | |
| bool | operator< (const GraphItem &) const |
| Ordering operator. More... | |
|
inline |
Default constructor.
Constructor for conversion from INVALID. It initializes the item to be invalid.
|
inline |
Equality operator.
|
inline |
Inequality operator.
|
inline |
This operator defines an ordering of the items. It makes possible to use graph item types as key types in associative containers (e.g. std::map).
1.8.5