Graph::Arc Class Reference

---

Detailed Description

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

#include <lemon/concepts/graph.h>

Inheritance diagram for Graph::Arc:

List of all members.

Public Member Functions
	Arc ()
	Default constructor.
	Arc (const Arc &)
	Arc (Invalid)
bool	operator== (Arc) const
	Equality operator.
bool	operator!= (Arc) const
	Inequality operator.
bool	operator< (Arc) const
	Artificial ordering operator.
	operator Edge () const
	Converison to Edge.

---

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 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.