OutArcIt Class Reference


Detailed Description

This iterator goes trough the outgoing arcs of a certain node of a graph. Its usage is quite simple, for example you can count the number of outgoing arcs of a node n in graph g of type Graph as follows.
          int count=0;
          for (Graph::OutArcIt e(g, n); e!=INVALID; ++e) ++count;
#include <lemon/concepts/graph.h>

Inheritance diagram for OutArcIt:

Inheritance graph
[legend]

List of all members.

Public Member Functions

 OutArcIt ()
 Default constructor.
 OutArcIt (const OutArcIt &e)
 OutArcIt (Invalid)
 OutArcIt (const Graph &n, const Node &g)
 This constructor sets the iterator to the first outgoing arc.
 OutArcIt (const Graph &, const Arc &)
 Arc -> OutArcIt conversion.
OutArcItoperator++ ()
 Next outgoing arc.


Constructor & Destructor Documentation

OutArcIt (  )  [inline]

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

OutArcIt ( const OutArcIt e  )  [inline]

Copy constructor.

OutArcIt ( Invalid   )  [inline]

Initialize the iterator to be invalid.

OutArcIt ( const Graph n,
const Node g 
) [inline]

This constructor sets the iterator to the first outgoing arc of the node.

Parameters:
n the node
g the graph

OutArcIt ( const Graph ,
const Arc  
) [inline]

Sets the iterator to the value of the trivial iterator. This feature necessitates that each time we iterate the arc-set, the iteration order is the same.


Member Function Documentation

OutArcIt& operator++ (  )  [inline]

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


doxygen