diff -r f67737f5727a -r e15162d8eca1 lemon/smart_graph.h
--- a/lemon/smart_graph.h	Tue Aug 16 16:44:57 2005 +0000
+++ b/lemon/smart_graph.h	Tue Aug 16 19:06:59 2005 +0000
@@ -89,12 +89,12 @@
     
     /// Maximum node ID.
     ///\sa id(Node)
-    int maxId(Node = INVALID) const { return nodes.size()-1; }
+    int maxId(Node) const { return nodes.size()-1; }
     /// Maximum edge ID.
     
     /// Maximum edge ID.
     ///\sa id(Edge)
-    int maxId(Edge = INVALID) const { return edges.size()-1; }
+    int maxId(Edge) const { return edges.size()-1; }
 
     Node source(Edge e) const { return edges[e.n].source; }
     Node target(Edge e) const { return edges[e.n].target; }
@@ -102,8 +102,8 @@
     /// Node ID.
     
     /// The ID of a valid Node is a nonnegative integer not greater than
-    /// \ref maxNodeId(). The range of the ID's is not surely continuous
-    /// and the greatest node ID can be actually less then \ref maxNodeId().
+    /// \ref maxId(Node). The range of the ID's is not surely continuous
+    /// and the greatest node ID can be actually less then \ref maxId(Node).
     ///
     /// The ID of the \ref INVALID node is -1.
     ///\return The ID of the node \c v. 
@@ -111,8 +111,8 @@
     /// Edge ID.
     
     /// The ID of a valid Edge is a nonnegative integer not greater than
-    /// \ref maxEdgeId(). The range of the ID's is not surely continuous
-    /// and the greatest edge ID can be actually less then \ref maxEdgeId().
+    /// \ref maxId(Edge). The range of the ID's is not surely continuous
+    /// and the greatest edge ID can be actually less then \ref maxId(Edge).
     ///
     /// The ID of the \ref INVALID edge is -1.
     ///\return The ID of the edge \c e.