1.1 --- a/lemon/smart_graph.h	Tue Aug 16 16:44:57 2005 +0000
     1.2 +++ b/lemon/smart_graph.h	Tue Aug 16 19:06:59 2005 +0000
     1.3 @@ -89,12 +89,12 @@
     1.4      
     1.5      /// Maximum node ID.
     1.6      ///\sa id(Node)
     1.7 -    int maxId(Node = INVALID) const { return nodes.size()-1; }
     1.8 +    int maxId(Node) const { return nodes.size()-1; }
     1.9      /// Maximum edge ID.
    1.10      
    1.11      /// Maximum edge ID.
    1.12      ///\sa id(Edge)
    1.13 -    int maxId(Edge = INVALID) const { return edges.size()-1; }
    1.14 +    int maxId(Edge) const { return edges.size()-1; }
    1.15  
    1.16      Node source(Edge e) const { return edges[e.n].source; }
    1.17      Node target(Edge e) const { return edges[e.n].target; }
    1.18 @@ -102,8 +102,8 @@
    1.19      /// Node ID.
    1.20      
    1.21      /// The ID of a valid Node is a nonnegative integer not greater than
    1.22 -    /// \ref maxNodeId(). The range of the ID's is not surely continuous
    1.23 -    /// and the greatest node ID can be actually less then \ref maxNodeId().
    1.24 +    /// \ref maxId(Node). The range of the ID's is not surely continuous
    1.25 +    /// and the greatest node ID can be actually less then \ref maxId(Node).
    1.26      ///
    1.27      /// The ID of the \ref INVALID node is -1.
    1.28      ///\return The ID of the node \c v. 
    1.29 @@ -111,8 +111,8 @@
    1.30      /// Edge ID.
    1.31      
    1.32      /// The ID of a valid Edge is a nonnegative integer not greater than
    1.33 -    /// \ref maxEdgeId(). The range of the ID's is not surely continuous
    1.34 -    /// and the greatest edge ID can be actually less then \ref maxEdgeId().
    1.35 +    /// \ref maxId(Edge). The range of the ID's is not surely continuous
    1.36 +    /// and the greatest edge ID can be actually less then \ref maxId(Edge).
    1.37      ///
    1.38      /// The ID of the \ref INVALID edge is -1.
    1.39      ///\return The ID of the edge \c e.