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.
|
int | id (const RedNode &) const |
| Return a unique integer id for the given node in the red set. More...
|
|
int | id (const BlueNode &) const |
| Return a unique integer id for the given node in the blue set. More...
|
|
int | maxRedId () const |
| Return an integer greater or equal to the maximum node id in the red set. More...
|
|
int | maxBlueId () const |
| Return an integer greater or equal to the maximum node id in the blue set. More...
|
|
int | id (const Edge &) const |
| Return a unique integer id for the given edge. More...
|
|
Edge | edgeFromId (int) const |
| Return the edge by its unique id. More...
|
|
int | maxEdgeId () const |
| Return an integer greater or equal to the maximum edge id. More...
|
|
int | id (const Node &) const |
| Return a unique integer id for the given node. More...
|
|
Node | nodeFromId (int) const |
| Return the node by its unique id. More...
|
|
int | id (const Arc &) const |
| Return a unique integer id for the given arc. More...
|
|
Arc | arcFromId (int) const |
| Return the arc by its unique id. More...
|
|
int | maxNodeId () const |
| Return an integer greater or equal to the maximum node id. More...
|
|
int | maxArcId () const |
| Return an integer greater or equal to the maximum arc id. More...
|
|