UndirGraph::Edge Class Reference
#include <lemon/concept/undir_graph.h>
Inherits UndirGraph::UndirEdge.
Inherited by UndirGraph::EdgeIt, UndirGraph::InEdgeIt, and UndirGraph::OutEdgeIt.
Inheritance diagram for UndirGraph::Edge:
[legend]List of all members.
Detailed Description
The directed edge type. It can be converted to the undirected edge.
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== |
( |
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.
- 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:00 2005 for LEMON by
1.4.4