concepts::GraphItem

Declared in lemon/concepts/graph_components.h, in the group Graph Structure Concepts; the same class on the Doxygen site.

class GraphItem

Concept class for Node, Arc and Edge types.

This class describes the concept of Node, Arc and Edge subtypes of digraph and graph types.

Note

This class is a template class so that we can use it to create graph skeleton classes. The reason for this is that 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'.

Public Functions

inline GraphItem()

Default constructor.

Warning

The default constructor is not required to set the item to some well-defined value. So you should consider it as uninitialized.

inline GraphItem( const GraphItem & )

Copy constructor.

inline GraphItem(Invalid)

Constructor for conversion from INVALID. It initializes the item to be invalid.

See also

Invalid for more details.

inline GraphItem & operator=( const GraphItem & )

Assignment operator.

Assignment operator for the item.

inline GraphItem & operator=(Invalid)

Assignment operator for INVALID.

This operator makes the item invalid.

inline bool operator==( const GraphItem & ) const

Equality operator.

inline bool operator!=( const GraphItem & ) const

Inequality operator.

inline bool operator<( const GraphItem & ) const

Ordering operator.

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).

Note

This operator only has to define some strict ordering of the items; this order has nothing to do with the iteration ordering of the items.

template< typename _GraphItem >
struct Constraints

Public Functions

inline void constraints()
inline Constraints()

Public Members

const _GraphItem & ia
const _GraphItem & ib