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

StaticSymGraph::SymEdge Class Reference

#include <lemon/concept/sym_graph.h>

Inheritance diagram for StaticSymGraph::SymEdge:

Inheritance graph
[legend]
List of all members.

Detailed Description

The base type of the symmetric edge iterators.

Definition at line 160 of file sym_graph.h.

Public Member Functions

 SymEdge ()
 Default constructor.
 SymEdge (const SymEdge &)
 Copy constructor.
 SymEdge (Invalid)
 Initialize the iterator to be invalid.
bool operator== (SymEdge) const
 Equality operator.
bool operator!= (SymEdge) const
 Inequality operator.
bool operator< (SymEdge) const
 Comparison operator.


Constructor & Destructor Documentation

SymEdge  )  [inline]
 

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

Definition at line 166 of file sym_graph.h.

SymEdge const SymEdge  )  [inline]
 

Copy constructor.

Definition at line 171 of file sym_graph.h.

SymEdge Invalid   )  [inline]
 

Initialize the iterator to be invalid.

Definition at line 176 of file sym_graph.h.


Member Function Documentation

bool operator== SymEdge   )  const [inline]
 

Two iterators are equal if and only if they point to the same object or both are invalid.

Definition at line 181 of file sym_graph.h.

bool operator!= SymEdge   )  const [inline]
 

See also:
operator==(Node n)

Definition at line 186 of file sym_graph.h.

bool operator< SymEdge   )  const [inline]
 

This is a strict ordering between the nodes.

This ordering can be different from the order in which NodeIt goes through the nodes.

Todo:
Possibly we don't need it.

Definition at line 194 of file sym_graph.h.


The documentation for this class was generated from the following file:
Generated on Sat Mar 19 10:59:02 2005 for LEMON by  doxygen 1.4.1