concepts::IterableBpGraphComponent

Declared in lemon/concepts/graph_components.h, in the group Graph Structure Concepts; the same class on the Doxygen site.

template< typename BAS = BaseBpGraphComponent >
class IterableBpGraphComponent : public IterableGraphComponent< BaseBpGraphComponent >

Skeleton class for iterable undirected bipartite graphs.

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.

Class Based Iteration

This interface provides iterator classes for red and blue nodes.

typedef GraphItemIt< BpGraph , RedNode > RedNodeIt

This iterator goes through each red node.

typedef GraphItemIt< BpGraph , BlueNode > BlueNodeIt

This iterator goes through each blue node.

Base Iteration

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

inline void first(RedNode&) const

Return the first red node.

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

inline void next(RedNode&) const

Return the next red node.

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

inline void first(BlueNode&) const

Return the first blue node.

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

inline void next(BlueNode&) const

Return the next blue node.

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

Public Types

typedef BAS Base
typedef Base::Node Node
typedef Base::RedNode RedNode
typedef Base::BlueNode BlueNode
typedef Base::Arc Arc
typedef Base::Edge Edge
typedef IterableBpGraphComponent BpGraph
template< typename _BpGraph >
struct Constraints

Public Functions

inline void constraints()

Public Members

const _BpGraph & bpgraph