diff -r b5fb023cdb7b -r 0f1044b7a3af src/lemon/full_graph.h
--- a/src/lemon/full_graph.h	Wed Nov 10 21:59:59 2004 +0000
+++ b/src/lemon/full_graph.h	Thu Nov 11 09:31:55 2004 +0000
@@ -18,7 +18,6 @@
 #define LEMON_FULL_GRAPH_H
 
 
-#include <lemon/idmappable_graph_extender.h>
 #include <lemon/iterable_graph_extender.h>
 #include <lemon/alteration_observer_registry.h>
 #include <lemon/default_map.h>
@@ -70,12 +69,12 @@
     
     /// Maximum node ID.
     ///\sa id(Node)
-    int maxNodeId() const { return NodeNum-1; }
+    int maxId(Node = INVALID) const { return NodeNum-1; }
     /// Maximum edge ID.
     
     /// Maximum edge ID.
     ///\sa id(Edge)
-    int maxEdgeId() const { return EdgeNum-1; }
+    int maxId(Edge = INVALID) const { return EdgeNum-1; }
 
     Node tail(Edge e) const { return e.id % NodeNum; }
     Node head(Edge e) const { return e.id / NodeNum; }
@@ -188,8 +187,7 @@
 
   typedef AlterableGraphExtender<FullGraphBase> AlterableFullGraphBase;
   typedef IterableGraphExtender<AlterableFullGraphBase> IterableFullGraphBase;
-  typedef IdMappableGraphExtender<IterableFullGraphBase> IdMappableFullGraphBase;
-  typedef DefaultMappableGraphExtender<IdMappableFullGraphBase> MappableFullGraphBase;
+  typedef DefaultMappableGraphExtender<IterableFullGraphBase> MappableFullGraphBase;
 
   ///A full graph class.