My Project
Loading...
Searching...
No Matches
Graph::Edge Class Reference

Detailed Description

This class identifies an edge of the graph. It also serves as a base class of the edge iterators, thus they will convert to this type.

#include <lemon/concepts/graph.h>

Public Member Functions

 Edge ()
 Default constructor.
 
 Edge (const Edge &)
 Copy constructor.
 
 Edge (Invalid)
 Invalid constructor & conversion.
 
bool operator== (Edge) const
 Equality operator.
 
bool operator!= (Edge) const
 Inequality operator.
 
bool operator< (Edge) const
 Artificial ordering operator.
 

Constructor & Destructor Documentation

◆ Edge() [1/3]

Edge ( )
inline

Default constructor.

Warning
It sets the object to an undefined value.

◆ Edge() [2/3]

Edge ( const Edge & )
inline

Copy constructor.

◆ Edge() [3/3]

Edge ( Invalid )
inline

Initializes the object to be invalid.

See also
Invalid for more details.

Member Function Documentation

◆ operator==()

bool operator== ( Edge ) const
inline

Equality operator.

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

◆ operator!=()

bool operator!= ( Edge ) const
inline

Inequality operator.

◆ operator<()

bool operator< ( Edge ) const
inline

Artificial ordering operator.

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