IDableGraphComponent Class Template Reference

#include <lemon/concepts/graph_components.h>

Inherited by IDableUGraphComponent.

Inheritance diagram for IDableGraphComponent:

Inheritance graph
[legend]
List of all members.

Detailed Description

template<typename _Base = BaseGraphComponent>
class lemon::concepts::IDableGraphComponent< _Base >

This class provides beside the core graph features core id functions for the graph structure. The most of the base graphs should be conform to this concept. The id's are unique and immutable.


Public Member Functions

int id (const Node &) const
 Gives back an unique integer id for the Node.
Node nodeFromId (int) const
 Gives back the node by the unique id.
int id (const Edge &) const
 Gives back an unique integer id for the Edge.
Edge edgeFromId (int) const
 Gives back the edge by the unique id.
int maxNodeId () const
 Gives back an integer greater or equal to the maximum Node id.
int maxEdgeId () const
 Gives back an integer greater or equal to the maximum Edge id.


Member Function Documentation

int id ( const Node &   )  const [inline]

Gives back an unique integer id for the Node.

Node nodeFromId ( int   )  const [inline]

Gives back the node by the unique id. If the graph does not contain node with the given id then the result of the function is undetermined.

int id ( const Edge &   )  const [inline]

Gives back an unique integer id for the Edge.

Edge edgeFromId ( int   )  const [inline]

Gives back the 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 maxNodeId (  )  const [inline]

Gives back an integer greater or equal to the maximum Node id.

int maxEdgeId (  )  const [inline]

Gives back an integer greater or equal to the maximum Edge id.


The documentation for this class was generated from the following file:
Generated on Tue Oct 31 09:51:40 2006 for LEMON by  doxygen 1.5.1