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

IterableGraphComponent Class Reference
[Graph Structure Concepts]

#include <lemon/concept/graph_component.h>

Inheritance diagram for IterableGraphComponent:

Inheritance graph
[legend]
Collaboration diagram for IterableGraphComponent:

Collaboration graph
[legend]
List of all members.

Detailed Description

This class provides beside the core graph features iterator based iterable interface for the graph structure. This concept is part of the StaticGraphConcept.

Definition at line 650 of file graph_component.h.

Public Types

typedef GraphIterator< Graph,
Node
NodeIt
 This iterator goes through each node.
typedef GraphIterator< Graph,
Edge
EdgeIt
 This iterator goes through each node.
typedef GraphIncIterator<
Graph, Edge, 'i'> 
InEdgeIt
 This iterator goes trough the incoming edges of a node.
typedef GraphIncIterator<
Graph, Edge, 'o'> 
OutEdgeIt
 This iterator goes trough the outgoing edges of a node.


Member Typedef Documentation

typedef GraphIterator<Graph, Node> NodeIt
 

This iterator goes through each node.

Definition at line 663 of file graph_component.h.

typedef GraphIterator<Graph, Edge> EdgeIt
 

This iterator goes through each node.

Definition at line 668 of file graph_component.h.

typedef GraphIncIterator<Graph, Edge, 'i'> InEdgeIt
 

This iterator goes trough the inccoming edges of a certain node of a graph.

Definition at line 673 of file graph_component.h.

typedef GraphIncIterator<Graph, Edge, 'o'> OutEdgeIt
 

This iterator goes trough the outgoing edges of a certain node of a graph.

Definition at line 678 of file graph_component.h.


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