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

StaticSymGraph::SymEdgeIt Class Reference

#include <lemon/concept/sym_graph.h>

Inheritance diagram for StaticSymGraph::SymEdgeIt:

Inheritance graph
[legend]
Collaboration diagram for StaticSymGraph::SymEdgeIt:

Collaboration graph
[legend]
List of all members.

Detailed Description

This iterator goes through each symmetric edge of a graph. Its usage is quite simple, for example you can count the number of symmetric edges in a graph g of type Graph as follows:
          int count=0;
          for(Graph::SymEdgeIt e(g); e!=INVALID; ++e) ++count;

Definition at line 345 of file sym_graph.h.

Public Member Functions

 SymEdgeIt ()
 Default constructor.
 SymEdgeIt (const SymEdgeIt &)
 Copy constructor.
 SymEdgeIt (Invalid)
 Initialize the iterator to be invalid.
 SymEdgeIt (const StaticSymGraph &g)
 This constructor sets the iterator to first edge.
 SymEdgeIt (const StaticSymGraph &, const SymEdge &)
 Edge -> EdgeIt conversion.
SymEdgeItoperator++ ()
 Next edge.


Constructor & Destructor Documentation

SymEdgeIt  )  [inline]
 

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

Definition at line 351 of file sym_graph.h.

SymEdgeIt const SymEdgeIt  )  [inline]
 

Copy constructor.

Definition at line 356 of file sym_graph.h.

SymEdgeIt Invalid   )  [inline]
 

Initialize the iterator to be invalid.

Definition at line 361 of file sym_graph.h.

SymEdgeIt const StaticSymGraph g  )  [inline]
 

This constructor set the iterator to the first edge of node

Parameters:
g the graph

Definition at line 367 of file sym_graph.h.

SymEdgeIt const StaticSymGraph ,
const SymEdge
[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 373 of file sym_graph.h.


Member Function Documentation

SymEdgeIt& operator++  )  [inline]
 

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

Definition at line 378 of file sym_graph.h.


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