concepts::IDableBpGraphComponent

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 IDableBpGraphComponent : public IDableGraphComponent< BaseBpGraphComponent >

Skeleton class for idable undirected bipartite graphs.

This class describes the interface of idable undirected bipartite graphs. It extends IDableGraphComponent with the core ID functions of undirected bipartite graphs. Beside the regular node ids, this class also provides ids within the the red and blue sets of the nodes. This concept is part of the BpGraph concept.

Public Types

typedef BAS Base
typedef IDableGraphComponent< BAS > Parent
typedef Base::Node Node
typedef Base::RedNode RedNode
typedef Base::BlueNode BlueNode

Public Functions

inline int id( const RedNode & ) const

Return a unique integer id for the given node in the red set.

inline int id( const BlueNode & ) const

Return a unique integer id for the given node in the blue set.

inline int maxRedId() const

Return an integer greater or equal to the maximum node id in the red set.

inline int maxBlueId() const

Return an integer greater or equal to the maximum node id in the blue set.

inline int id( const Edge & ) const

Return a unique integer id for the given edge.

This function returns a unique integer id for the given edge.

template< typename _BpGraph >
struct Constraints

Public Functions

inline void constraints()

Public Members

const _BpGraph & bpgraph