1.1 --- a/lemon/full_graph.h	Thu Nov 05 15:50:01 2009 +0100
     1.2 +++ b/lemon/full_graph.h	Sun Nov 15 19:57:02 2009 +0100
     1.3 @@ -162,6 +162,8 @@
     1.4    /// Most of its member functions and nested classes are documented
     1.5    /// only in the concept class.
     1.6    ///
     1.7 +  /// This class provides constant time counting for nodes and arcs.
     1.8 +  ///
     1.9    /// \note FullDigraph and FullGraph classes are very similar,
    1.10    /// but there are two differences. While this class conforms only
    1.11    /// to the \ref concepts::Digraph "Digraph" concept, FullGraph
    1.12 @@ -204,6 +206,7 @@
    1.13      /// Returns the node with the given index. Since this structure is 
    1.14      /// completely static, the nodes can be indexed with integers from
    1.15      /// the range <tt>[0..nodeNum()-1]</tt>.
    1.16 +    /// The index of a node is the same as its ID.
    1.17      /// \sa index()
    1.18      Node operator()(int ix) const { return Parent::operator()(ix); }
    1.19  
    1.20 @@ -212,6 +215,7 @@
    1.21      /// Returns the index of the given node. Since this structure is 
    1.22      /// completely static, the nodes can be indexed with integers from
    1.23      /// the range <tt>[0..nodeNum()-1]</tt>.
    1.24 +    /// The index of a node is the same as its ID.
    1.25      /// \sa operator()()
    1.26      static int index(const Node& node) { return Parent::index(node); }
    1.27  
    1.28 @@ -535,6 +539,8 @@
    1.29    /// Most of its member functions and nested classes are documented
    1.30    /// only in the concept class.
    1.31    ///
    1.32 +  /// This class provides constant time counting for nodes, edges and arcs.
    1.33 +  ///
    1.34    /// \note FullDigraph and FullGraph classes are very similar,
    1.35    /// but there are two differences. While FullDigraph
    1.36    /// conforms only to the \ref concepts::Digraph "Digraph" concept,
    1.37 @@ -579,6 +585,7 @@
    1.38      /// Returns the node with the given index. Since this structure is 
    1.39      /// completely static, the nodes can be indexed with integers from
    1.40      /// the range <tt>[0..nodeNum()-1]</tt>.
    1.41 +    /// The index of a node is the same as its ID.
    1.42      /// \sa index()
    1.43      Node operator()(int ix) const { return Parent::operator()(ix); }
    1.44  
    1.45 @@ -587,6 +594,7 @@
    1.46      /// Returns the index of the given node. Since this structure is 
    1.47      /// completely static, the nodes can be indexed with integers from
    1.48      /// the range <tt>[0..nodeNum()-1]</tt>.
    1.49 +    /// The index of a node is the same as its ID.
    1.50      /// \sa operator()()
    1.51      static int index(const Node& node) { return Parent::index(node); }
    1.52