IDableBpGraphComponent< BAS > Class Template Reference

Detailed Description

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

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.

#include <lemon/concepts/graph_components.h>

Inheritance diagram for IDableBpGraphComponent< BAS >:

Public Member Functions
int	id (const RedNode &) const
int	id (const BlueNode &) const
int	maxRedId () const
int	maxBlueId () const
Public Member Functions inherited from IDableGraphComponent< BAS >
int	id (const Edge &) const
	Return a unique integer id for the given edge.
Edge	edgeFromId (int) const
	Return the edge by its unique id.
int	maxEdgeId () const
	Return an integer greater or equal to the maximum edge id.
Public Member Functions inherited from IDableDigraphComponent< BAS >
int	id (const Node &) const
	Return a unique integer id for the given node.
Node	nodeFromId (int) const
	Return the node by its unique id.
int	id (const Arc &) const
	Return a unique integer id for the given arc.
Arc	arcFromId (int) const
	Return the arc by its unique id.
int	maxNodeId () const
	Return an integer greater or equal to the maximum node id.
int	maxArcId () const
	Return an integer greater or equal to the maximum arc id.

Member Function Documentation

int id ( const RedNode &  ) const

inline

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

int id ( const BlueNode &  ) const

inline

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

int maxRedId ( ) const

inline

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

int maxBlueId ( ) const

inline

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