Public Member Functions

Digraph::OutArcIt Class Reference

Detailed Description

This iterator goes trough the outgoing arcs of a certain node of a digraph. Its usage is quite simple, for example, you can count the number of outgoing arcs of a node n in a digraph g of type Digraph as follows.

          int count=0;
          for (Digraph::OutArcIt a(g, n); a!=INVALID; ++a) ++count;

#include <lemon/concepts/digraph.h>

Inheritance diagram for Digraph::OutArcIt:

List of all members.

Public Member Functions

 OutArcIt ()
 Default constructor.
 OutArcIt (const OutArcIt &e)
 OutArcIt (Invalid)
 Invalid constructor & conversion.
 OutArcIt (const Digraph &, const Node &)
 Sets the iterator to the first outgoing arc.
 OutArcIt (const Digraph &, const Arc &)
 Sets the iterator to the given arc.
OutArcItoperator++ ()
 Next outgoing arc.

Constructor & Destructor Documentation

OutArcIt ( ) [inline]

Default constructor.

It sets the iterator to an undefined value.
OutArcIt ( const OutArcIt e) [inline]

Copy constructor.

OutArcIt ( Invalid  ) [inline]

Initializes the iterator to be invalid.

See also:
Invalid for more details.
OutArcIt ( const Digraph ,
const Node  
) [inline]

Sets the iterator to the first outgoing arc of the given node.

OutArcIt ( const Digraph ,
const Arc  
) [inline]

Sets the iterator to the given arc of the given digraph.

Member Function Documentation

OutArcIt& operator++ ( ) [inline]

Assign the iterator to the next outgoing arc of the corresponding node.

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines