BpUGraph::BNode Class Reference

#include <lemon/concept/bpugraph.h>

Inherited by BpUGraph::BNodeIt.

Inheritance diagram for BpUGraph::BNode:

Inheritance graph
[legend]
List of all members.

Detailed Description

This is the base type of each anode iterator, thus each kind of anode iterator converts to this. More precisely each kind of node iterator should be inherited from the trivial anode iterator. The BNode class should be used only in special cases. Usually the Node type should be used insted of it.


Public Member Functions

 BNode ()
 Default constructor.
 BNode (const BNode &)
 Copy constructor.
 BNode (const Node &)
 Construct the same node as BNode.
 BNode (Invalid)
 Invalid constructor & conversion.
bool operator== (BNode) const
 Equality operator.
bool operator!= (BNode) const
 Inequality operator.
bool operator< (BNode) const
 Artificial ordering operator.


Constructor & Destructor Documentation

BNode  )  [inline]
 

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

BNode const BNode  )  [inline]
 

Copy constructor.

BNode const Node  )  [inline]
 

Construct the same node as BNode. It may throws assertion when the given node is from the ANode set.

BNode Invalid   )  [inline]
 

This constructor initializes the iterator to be invalid.

See also:
Invalid for more details.


Member Function Documentation

bool operator== BNode   )  const [inline]
 

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

bool operator!= BNode   )  const [inline]
 

See also:
operator==(BNode n)

bool operator< BNode   )  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 Fri Feb 3 18:43:08 2006 for LEMON by  doxygen 1.4.6