Digraph::Node Class Reference

---

Detailed Description

This class identifies a node of the digraph. It also serves as a base class of the node iterators, thus they will convert to this type.

#include <lemon/concepts/digraph.h>

Inheritance diagram for Digraph::Node:

List of all members.

Public Member Functions
	Node ()
	Default constructor.
	Node (const Node &)
	Node (Invalid)
	Invalid constructor & conversion.
bool	operator== (Node) const
	Equality operator.
bool	operator!= (Node) const
	Inequality operator.
bool	operator< (Node) const
	Artificial ordering operator.

---

Constructor & Destructor Documentation

Node

(

)

[inline]

Warning:

The default constructor sets the iterator to an undefined value.

Node

(

const Node &

)

[inline]

Copy constructor.

Node

(

Invalid

)

[inline]

This constructor initializes the iterator to be invalid.

See also:

Invalid for more details.

---

Member Function Documentation

bool operator==

(

Node

)

const [inline]

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

bool operator!=

(

Node

)

const [inline]

See also:

operator==(Node n)

bool operator<

(

Node

)

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.