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

StaticSymGraph::Edge Class Reference

#include <lemon/concept/sym_graph.h>

Inheritance diagram for StaticSymGraph::Edge:

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

Collaboration graph
[legend]
List of all members.

Detailed Description

The base type of the edge iterators.

Definition at line 202 of file sym_graph.h.

Public Member Functions

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


Constructor & Destructor Documentation

Edge  )  [inline]
 

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

Definition at line 208 of file sym_graph.h.

Edge const Edge  )  [inline]
 

Copy constructor.

Definition at line 213 of file sym_graph.h.

Edge Invalid   )  [inline]
 

Initialize the iterator to be invalid.

Definition at line 218 of file sym_graph.h.


Member Function Documentation

bool operator== Edge   )  const [inline]
 

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

Definition at line 223 of file sym_graph.h.

bool operator!= Edge   )  const [inline]
 

See also:
operator==(Node n)

Definition at line 228 of file sym_graph.h.

bool operator< Edge   )  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 236 of file sym_graph.h.


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