All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines
IterableBpGraphComponent< BAS > Class Template Reference

Detailed Description

template<typename BAS = BaseBpGraphComponent>
class lemon::concepts::IterableBpGraphComponent< BAS >

This class describes the interface of iterable undirected bipartite graphs. It extends IterableGraphComponent with the core iterable interface of undirected bipartite graphs. This concept is part of the BpGraph concept.

#include <lemon/concepts/graph_components.h>

+ Inheritance diagram for IterableBpGraphComponent< BAS >:

List of all members.

Public Types

Class Based Iteration

This interface provides iterator classes for red and blue nodes.

typedef GraphItemIt< BpGraph,
RedNode > 
RedNodeIt
typedef GraphItemIt< BpGraph,
BlueNode > 
BlueNodeIt

Public Member Functions

Base Iteration

This interface provides functions for iteration on red and blue nodes.

void first (RedNode &) const
 Return the first red node.
void next (RedNode &) const
 Return the next red node.
void first (BlueNode &) const
 Return the first blue node.
void next (BlueNode &) const
 Return the next blue node.

Member Typedef Documentation

typedef GraphItemIt<BpGraph, RedNode> RedNodeIt

This iterator goes through each red node.

typedef GraphItemIt<BpGraph, BlueNode> BlueNodeIt

This iterator goes through each blue node.


Member Function Documentation

void first ( RedNode &  ) const [inline]

This function gives back the first red node in the iteration order.

void next ( RedNode &  ) const [inline]

This function gives back the next red node in the iteration order.

void first ( BlueNode &  ) const [inline]

This function gives back the first blue node in the iteration order.

void next ( BlueNode &  ) const [inline]

This function gives back the next blue node in the iteration order.

 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Defines