IterableBpUGraphComponent Class Template Reference

#include <lemon/concepts/graph_components.h>

Inherits IterableUGraphComponent< _Base >.

Inheritance diagram for IterableBpUGraphComponent:

Inheritance graph
[legend]
List of all members.

Detailed Description

template<typename _Base = BaseUGraphComponent>
class lemon::concepts::IterableBpUGraphComponent< _Base >

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


Public Types

Class based iteration
This interface provides functions for iteration on graph items

typedef GraphItemIt< Graph,
Node > 
ANodeIt
 This iterator goes through each A-node.
typedef GraphItemIt< Graph,
Node > 
BNodeIt
 This iterator goes through each B-node.

Public Member Functions

Base iteration
This interface provides functions for iteration on graph items

void firstANode (Node &) const
 Gives back the first A-node in the iterating order.
void nextANode (Node &) const
 Gives back the next A-node in the iterating order.
void firstBNode (Node &) const
 Gives back the first B-node in the iterating order.
void nextBNode (Node &) const
 Gives back the next B-node in the iterating order.
void firstFromANode (UEdge &, const Node &) const
 Gives back the first of the undirected edges start from the given A-node.
void nextFromANode (UEdge &) const
 Gives back the next of the undirected edges start from the given A-node.
void firstFromBNode (UEdge &, const Node &) const
 Gives back the first of the undirected edges start from the given B-node.
void nextFromBNode (UEdge &) const
 Gives back the next of the undirected edges start from the given B-node.


Member Typedef Documentation

typedef GraphItemIt<Graph, Node> ANodeIt

This iterator goes through each A-node.

typedef GraphItemIt<Graph, Node> BNodeIt

This iterator goes through each B-node.


Member Function Documentation

void firstANode ( Node &   )  const [inline]

Gives back the first undirected A-node in the iterating order.

void nextANode ( Node &   )  const [inline]

Gives back the next A-node in the iterating order.

void firstBNode ( Node &   )  const [inline]

Gives back the first undirected B-node in the iterating order.

void nextBNode ( Node &   )  const [inline]

Gives back the next B-node in the iterating order.

void firstFromANode ( UEdge &  ,
const Node &   
) const [inline]

Gives back the first of the undirected edges start from the given A-node.

void nextFromANode ( UEdge &   )  const [inline]

Gives back the next of the undirected edges start from the given A-node.

void firstFromBNode ( UEdge &  ,
const Node &   
) const [inline]

Gives back the first of the undirected edges start from the given B-node.

void nextFromBNode ( UEdge &   )  const [inline]

Gives back the next of the undirected edges start from the given B-node.


The documentation for this class was generated from the following file:
Generated on Tue Oct 31 09:51:40 2006 for LEMON by  doxygen 1.5.1