All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
List of all members | 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 digraph g of type Digraph as follows.

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

#include <lemon/concepts/digraph.h>

+ Inheritance diagram for Digraph::OutArcIt:

Public Member Functions

 OutArcIt ()
 Default constructor.
 
 OutArcIt (const OutArcIt &e)
 
 OutArcIt (Invalid)
 
 OutArcIt (const Digraph &, const Node &)
 This constructor sets the iterator to the first outgoing arc.
 
 OutArcIt (const Digraph &, const Arc &)
 Arc -> OutArcIt conversion.
 
OutArcItoperator++ ()
 Next outgoing arc.
 
- Public Member Functions inherited from Digraph::Arc
 Arc ()
 Default constructor.
 
 Arc (const Arc &)
 
 Arc (Invalid)
 
bool operator== (Arc) const
 Equality operator.
 
bool operator!= (Arc) const
 Inequality operator.
 
bool operator< (Arc) const
 Artificial ordering operator.
 

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 Digraph ,
const Node  
)
inline

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

OutArcIt ( const Digraph ,
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.