All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
List of all members | Public Member Functions
Digraph::InArcIt Class Reference

Detailed Description

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

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

#include <lemon/concepts/digraph.h>

+ Inheritance diagram for Digraph::InArcIt:

Public Member Functions

 InArcIt ()
 Default constructor.
 
 InArcIt (const InArcIt &e)
 
 InArcIt (Invalid)
 Invalid constructor & conversion.
 
 InArcIt (const Digraph &, const Node &)
 Sets the iterator to the first incoming arc.
 
 InArcIt (const Digraph &, const Arc &)
 Sets the iterator to the given arc.
 
InArcItoperator++ ()
 Next incoming arc.
 
- Public Member Functions inherited from Digraph::Arc
 Arc ()
 Default constructor.
 
 Arc (const Arc &)
 
 Arc (Invalid)
 Invalid constructor & conversion.
 
bool operator== (Arc) const
 Equality operator.
 
bool operator!= (Arc) const
 
bool operator< (Arc) const
 Artificial ordering operator.
 

Constructor & Destructor Documentation

InArcIt ( )
inline

Default constructor.

Warning
It sets the iterator to an undefined value.
InArcIt ( const InArcIt e)
inline

Copy constructor.

InArcIt ( Invalid  )
inline

Initializes the iterator to be invalid.

See Also
Invalid for more details.
InArcIt ( const Digraph ,
const Node  
)
inline

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

InArcIt ( const Digraph ,
const Arc  
)
inline

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

Member Function Documentation

InArcIt& operator++ ( )
inline

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