UGraph::UEdge Class Reference
#include <lemon/concept/ugraph.h>
Inherited by UGraph::Edge, UGraph::IncEdgeIt, UGraph::UEdgeIt, and UGraphEdge.
Inheritance diagram for UGraph::UEdge:
[legend]List of all members.
Detailed Description
The base type of the undirected edge iterators.
Constructor & Destructor Documentation
|
- Warning:
- The default constructor sets the iterator to an undefined value.
|
|
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.
- Bug:
- This is a technical requirement. Do we really need this?
|
The documentation for this class was generated from the following file:
Generated on Fri Feb 3 18:44:26 2006 for LEMON by
1.4.6