UEdge Class Reference


Detailed Description

The base type of the undirected edge iterators. #include <lemon/concepts/ugraph.h>

Inheritance diagram for UEdge:

Inheritance graph
[legend]

List of all members.

Public Member Functions

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


Constructor & Destructor Documentation

UEdge (  )  [inline]

Warning:
The default constructor sets the iterator to an undefined value.

UEdge ( const UEdge  )  [inline]

Copy constructor.

UEdge ( Invalid   )  [inline]

Initialize the iterator to be invalid.


Member Function Documentation

bool operator== ( UEdge   )  const [inline]

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

bool operator!= ( UEdge   )  const [inline]

See also:
operator==(UEdge n)

bool operator< ( UEdge   )  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.


Generated on Thu Jun 4 04:06:57 2009 for LEMON by  doxygen 1.5.9