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

StaticGraph::InEdgeIt Class Reference

#include <lemon/concept/graph.h>

Inheritance diagram for StaticGraph::InEdgeIt:

Inheritance graph
[legend]
Collaboration diagram for StaticGraph::InEdgeIt:

Collaboration graph
[legend]
List of all members.

Detailed Description

This iterator goes trough the incoming 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::InEdgeIt e(g, n); e!=INVALID; ++e) ++count;

Definition at line 308 of file graph.h.

Public Member Functions

 InEdgeIt ()
 Default constructor.
 InEdgeIt (const InEdgeIt &)
 Copy constructor.
 InEdgeIt (Invalid)
 Initialize the iterator to be invalid.
 InEdgeIt (const StaticGraph &g, const Node &n)
 This constructor sets the iterator to first incoming edge.
 InEdgeIt (const StaticGraph &g, const Edge &n)
 Edge -> InEdgeIt conversion.
InEdgeItoperator++ ()
 Next incoming edge.


Constructor & Destructor Documentation

InEdgeIt  )  [inline]
 

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

Definition at line 314 of file graph.h.

InEdgeIt const InEdgeIt  )  [inline]
 

Copy constructor.

Definition at line 319 of file graph.h.

InEdgeIt Invalid   )  [inline]
 

Initialize the iterator to be invalid.

Definition at line 324 of file graph.h.

InEdgeIt const StaticGraph g,
const Node n
[inline]
 

This constructor set the iterator to the first incoming edge of node

Parameters:
n the node
g the graph

Definition at line 331 of file graph.h.

InEdgeIt const StaticGraph g,
const Edge n
[inline]
 

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

Definition at line 337 of file graph.h.


Member Function Documentation

InEdgeIt& operator++  )  [inline]
 

Assign the iterator to the next inedge of the corresponding node.

Definition at line 342 of file graph.h.


The documentation for this class was generated from the following file:
Generated on Mon Feb 21 15:02:38 2005 for LEMON by  doxygen 1.4.1