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>
Public Member Functions | |
int | id (const RedNode &) const |
int | id (const BlueNode &) const |
int | maxRedId () const |
int | maxBlueId () const |
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.