IDableBpUGraphComponent< _Base > Class Template Reference
Detailed Description
template<typename _Base = BaseBpUGraphComponent>
class lemon::concepts::IDableBpUGraphComponent< _Base >
This class provides beside the core bipartite undirected graph features core id functions for the bipartite undirected graph structure. The most of the base undirected graphs should be conform to this concept. #include <lemon/concepts/graph_components.h>
Inheritance diagram for IDableBpUGraphComponent< _Base >:
Public Member Functions | |
| int | aNodeId (const Node &) const |
| Node | nodeFromANodeId (int) const |
| Gives back the undirected edge by the unique id. | |
| int | maxANodeId () const |
| int | bNodeId (const Node &) const |
| Node | nodeFromBNodeId (int) const |
| Gives back the undirected edge by the unique id. | |
| int | maxBNodeId () const |
Member Function Documentation
| int aNodeId | ( | const Node & | ) | const [inline] |
Gives back an unique integer id for the ANode.
| Node nodeFromANodeId | ( | int | ) | const [inline] |
Gives back the undirected edge by the unique id. If the graph does not contain edge with the given id then the result of the function is undetermined.
| int maxANodeId | ( | ) | const [inline] |
Gives back an integer greater or equal to the maximum ANode id.
| int bNodeId | ( | const Node & | ) | const [inline] |
Gives back an unique integer id for the BNode.
| Node nodeFromBNodeId | ( | int | ) | const [inline] |
Gives back the undirected edge by the unique id. If the graph does not contain edge with the given id then the result of the function is undetermined.
| int maxBNodeId | ( | ) | const [inline] |
Gives back an integer greater or equal to the maximum BNode id.
