All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines
Public Member Functions
BpGraph::RedNodeIt Class Reference

Detailed Description

This iterator goes through each red node of the graph. Its usage is quite simple, for example, you can count the number of red nodes in a graph g of type BpGraph like this:

          int count=0;
          for (BpGraph::RedNodeIt n(g); n!=INVALID; ++n) ++count;

#include <lemon/concepts/bpgraph.h>

+ Inheritance diagram for BpGraph::RedNodeIt:

List of all members.

Public Member Functions

 RedNodeIt ()
 Default constructor.
 RedNodeIt (const RedNodeIt &n)
 RedNodeIt (Invalid)
 Invalid constructor & conversion.
 RedNodeIt (const BpGraph &)
 Sets the iterator to the first red node.
 RedNodeIt (const BpGraph &, const RedNode &)
 Sets the iterator to the given red node.
RedNodeItoperator++ ()
 Next node.

Constructor & Destructor Documentation

RedNodeIt ( ) [inline]

Default constructor.

Warning:
It sets the iterator to an undefined value.
RedNodeIt ( const RedNodeIt n) [inline]

Copy constructor.

RedNodeIt ( Invalid  ) [inline]

Initializes the iterator to be invalid.

See also:
Invalid for more details.
RedNodeIt ( const BpGraph ) [inline, explicit]

Sets the iterator to the first red node of the given digraph.

RedNodeIt ( const BpGraph ,
const RedNode  
) [inline]

Sets the iterator to the given red node of the given digraph.


Member Function Documentation

RedNodeIt& operator++ ( ) [inline]

Assign the iterator to the next red node.

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines