Graph::Edge Class Reference

Detailed Description

The base type of the edge iterators.

#include <lemon/concepts/graph.h>

Inheritance diagram for Graph::Edge:

Public Member Functions
	Edge ()
	Default constructor.
	Edge (const Edge &)
	Edge (Invalid)
bool	operator== (Edge) const
	Equality operator.
bool	operator!= (Edge) const
	Inequality operator.
bool	operator< (Edge) const
	Artificial ordering operator.

Constructor & Destructor Documentation

Edge ( )

inline

Warning

The default constructor sets the iterator to an undefined value.

Edge ( const Edge &  )

inline

Copy constructor.

Edge ( Invalid  )

inline

Initialize the iterator to be invalid.

Member Function Documentation

bool operator== ( Edge  ) const

inline

Two iterators are equal if and only if they point to the same object or both are invalid.

bool operator!= ( Edge  ) const

inline

See Also

operator==(Edge n)

bool operator< ( Edge  ) const

inline

To allow the use of graph descriptors as key type in std::map or similar associative container we require this.

Note

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