Graph::Arc Class Reference

#include <lemon/concepts/graph.h>

Inheritance diagram for Graph::Arc:

Inheritance graph
[legend]

List of all members.


Detailed Description

The directed arc type. It can be converted to the edge or it should be inherited from the undirected arc.

Public Member Functions

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

Constructor & Destructor Documentation

Arc (  )  [inline]

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

Arc ( const Arc e  )  [inline]

Copy constructor.

Arc ( Invalid   )  [inline]

Initialize the iterator to be invalid.


Member Function Documentation

bool operator== ( Arc   )  const [inline]

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

bool operator!= ( Arc   )  const [inline]

See also:
operator==(Arc n)

bool operator< ( Arc   )  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 May 5 07:42:00 2009 for LEMON by  doxygen 1.5.6