template<typename BAS = BaseGraphComponent>
class lemon::concepts::IDableGraphComponent< BAS >
This class describes the interface of idable undirected graphs. It extends IDableDigraphComponent with the core ID functions of undirected graphs. The ids of the items must be unique and immutable. This concept is part of the Graph concept.
|
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.
|
|
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.
|
|
Node | source (const Arc &) const |
| Return the source node of an arc.
|
|
Node | target (const Arc &) const |
| Return the target node of an arc.
|
|
Node | oppositeNode (const Node &, const Arc &) const |
| Return the opposite node on the given arc.
|
|