1.1 --- a/src/lemon/full_graph.h	Wed Nov 10 21:59:59 2004 +0000
     1.2 +++ b/src/lemon/full_graph.h	Thu Nov 11 09:31:55 2004 +0000
     1.3 @@ -18,7 +18,6 @@
     1.4  #define LEMON_FULL_GRAPH_H
     1.5  
     1.6  
     1.7 -#include <lemon/idmappable_graph_extender.h>
     1.8  #include <lemon/iterable_graph_extender.h>
     1.9  #include <lemon/alteration_observer_registry.h>
    1.10  #include <lemon/default_map.h>
    1.11 @@ -70,12 +69,12 @@
    1.12      
    1.13      /// Maximum node ID.
    1.14      ///\sa id(Node)
    1.15 -    int maxNodeId() const { return NodeNum-1; }
    1.16 +    int maxId(Node = INVALID) const { return NodeNum-1; }
    1.17      /// Maximum edge ID.
    1.18      
    1.19      /// Maximum edge ID.
    1.20      ///\sa id(Edge)
    1.21 -    int maxEdgeId() const { return EdgeNum-1; }
    1.22 +    int maxId(Edge = INVALID) const { return EdgeNum-1; }
    1.23  
    1.24      Node tail(Edge e) const { return e.id % NodeNum; }
    1.25      Node head(Edge e) const { return e.id / NodeNum; }
    1.26 @@ -188,8 +187,7 @@
    1.27  
    1.28    typedef AlterableGraphExtender<FullGraphBase> AlterableFullGraphBase;
    1.29    typedef IterableGraphExtender<AlterableFullGraphBase> IterableFullGraphBase;
    1.30 -  typedef IdMappableGraphExtender<IterableFullGraphBase> IdMappableFullGraphBase;
    1.31 -  typedef DefaultMappableGraphExtender<IdMappableFullGraphBase> MappableFullGraphBase;
    1.32 +  typedef DefaultMappableGraphExtender<IterableFullGraphBase> MappableFullGraphBase;
    1.33  
    1.34    ///A full graph class.
    1.35