BpUGraph::Edge Class Reference

#include <lemon/concepts/bpugraph.h>

Inherits BpUGraph::UEdge.

Inherited by BpUGraph::EdgeIt, BpUGraph::InEdgeIt, and BpUGraph::OutEdgeIt.

Inheritance diagram for BpUGraph::Edge:

Inheritance graph
[legend]
List of all members.

Detailed Description

The directed edge type. It can be converted to the undirected edge.


Public Member Functions

 Edge ()
 Default constructor.
 Edge (const Edge &e)
 Copy constructor.
 Edge (Invalid)
 Initialize the iterator to be 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 e  )  [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.


The documentation for this class was generated from the following file:
Generated on Tue Oct 31 09:51:31 2006 for LEMON by  doxygen 1.5.1