concepts::IDableDigraphComponent
Declared in lemon/concepts/graph_components.h, in the group Graph Structure Concepts; the same class on the Doxygen site.
-
template< typename BAS = BaseDigraphComponent >
class IDableDigraphComponent : public BaseDigraphComponent Skeleton class for idable directed graphs.
This class describes the interface of idable directed graphs. It extends BaseDigraphComponent with the core ID functions. The ids of the items must be unique and immutable. This concept is part of the Digraph concept.
Subclassed by IDableGraphComponent< BAS >
Public Functions
-
inline int id( const Node & ) const
Return a unique integer id for the given node.
This function returns a unique integer id for the given node.
-
inline Node nodeFromId(int) const
Return the node by its unique id.
This function returns the node by its unique id. If the digraph does not contain a node with the given id, then the result of the function is undefined.
-
inline int id( const Arc & ) const
Return a unique integer id for the given arc.
This function returns a unique integer id for the given arc.
-
inline Arc arcFromId(int) const
Return the arc by its unique id.
This function returns the arc by its unique id. If the digraph does not contain an arc with the given id, then the result of the function is undefined.
-
inline int maxNodeId() const
Return an integer greater or equal to the maximum node id.
This function returns an integer greater or equal to the maximum node id.
-
inline int maxArcId() const
Return an integer greater or equal to the maximum arc id.
This function returns an integer greater or equal to the maximum arc id.
-
template< typename _Digraph >
struct Constraints
-
inline int id( const Node & ) const