Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

UndirGraph::UndirEdge Class Reference

#include <lemon/concept/undir_graph.h>

Inherited by UndirGraph::Edge, UndirGraph::IncEdgeIt, UndirGraph::UndirEdgeIt, and UndirGraphEdge.

Inheritance diagram for UndirGraph::UndirEdge:

Inheritance graph
[legend]
List of all members.

Detailed Description

The base type of the undirected edge iterators.


Public Member Functions

 UndirEdge ()
 Default constructor.
 UndirEdge (const UndirEdge &)
 Copy constructor.
 UndirEdge (Invalid)
 Initialize the iterator to be invalid.
bool operator== (UndirEdge) const
 Equality operator.
bool operator!= (UndirEdge) const
 Inequality operator.
bool operator< (UndirEdge) const
 Artificial ordering operator.


Constructor & Destructor Documentation

UndirEdge  )  [inline]
 

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

UndirEdge const UndirEdge  )  [inline]
 

Copy constructor.

UndirEdge Invalid   )  [inline]
 

Initialize the iterator to be invalid.


Member Function Documentation

bool operator== UndirEdge   )  const [inline]
 

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

bool operator!= UndirEdge   )  const [inline]
 

See also:
operator==(UndirEdge n)

bool operator< UndirEdge   )  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.
Bug:
This is a technical requirement. Do we really need this?


The documentation for this class was generated from the following file:
Generated on Sat Aug 27 14:17:10 2005 for LEMON by  doxygen 1.4.4