Digraph::Arc Class Reference


Detailed Description

This class identifies an arc of the digraph. It also serves as a base class of the arc iterators, thus they will convert to this type. #include <lemon/concepts/digraph.h>

Inheritance diagram for Digraph::Arc:

Inheritance graph
[legend]

List of all members.

Public Member Functions

 Arc ()
 Default constructor.
 Arc (const Arc &)
 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  )  [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 digraph 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 Sun Dec 7 10:49:57 2008 for LEMON by  doxygen 1.5.7.1