Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

StaticGraph::OutEdgeIt Class Reference

#include <lemon/concept/graph.h>

Inherits StaticGraph::Edge.

Inheritance diagram for StaticGraph::OutEdgeIt:

Inheritance graph
[legend]
List of all members.

Detailed Description

This iterator goes trough the outgoing edges of a certain node of a graph. Its usage is quite simple, for example you can count the number of outgoing edges of a node n in graph g of type Graph as follows.
          int count=0;
          for (Graph::OutEdgeIt e(g, n); e!=INVALID; ++e) ++count;


Public Member Functions

 OutEdgeIt ()
 Default constructor.
 OutEdgeIt (const OutEdgeIt &e)
 Copy constructor.
 OutEdgeIt (Invalid)
 Initialize the iterator to be invalid.
 OutEdgeIt (const StaticGraph &, const Node &)
 This constructor sets the iterator to the first outgoing edge.
 OutEdgeIt (const StaticGraph &, const Edge &)
 Edge -> OutEdgeIt conversion.
OutEdgeItoperator++ ()
 Next outgoing edge.


Constructor & Destructor Documentation

OutEdgeIt  )  [inline]
 

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

OutEdgeIt const OutEdgeIt e  )  [inline]
 

Copy constructor.

OutEdgeIt Invalid   )  [inline]
 

Initialize the iterator to be invalid.

OutEdgeIt const StaticGraph ,
const Node
[inline]
 

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

OutEdgeIt const StaticGraph ,
const Edge
[inline]
 

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


Member Function Documentation

OutEdgeIt& operator++  )  [inline]
 

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


The documentation for this class was generated from the following file:
Generated on Sat Aug 27 14:16:37 2005 for LEMON by  doxygen 1.4.4