Graph::Node Class Reference

#include <lemon/concepts/graph.h>

Inheritance diagram for Graph::Node:

Inheritance graph
[legend]

List of all members.


Detailed Description

This is the base type of each node iterator, thus each kind of node iterator converts to this. More precisely each kind of node iterator should be inherited from the trivial node iterator.

Public Member Functions

 Node ()
 Default constructor.
 Node (const Node &)
 Copy constructor.
 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 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:01 2009 for LEMON by  doxygen 1.5.6