1.1 --- a/src/lemon/full_graph.h	Wed Nov 10 19:59:14 2004 +0000
     1.2 +++ b/src/lemon/full_graph.h	Wed Nov 10 20:14:32 2004 +0000
     1.3 @@ -19,19 +19,19 @@
     1.4  
     1.5  
     1.6  #include <lemon/idmappable_graph_extender.h>
     1.7 -
     1.8  #include <lemon/iterable_graph_extender.h>
     1.9 -
    1.10  #include <lemon/alteration_observer_registry.h>
    1.11  #include <lemon/default_map.h>
    1.12  
    1.13 +#include <lemon/invalid.h>
    1.14 +#include <lemon/utility.h>
    1.15 +
    1.16 +
    1.17  ///\ingroup graphs
    1.18  ///\file
    1.19  ///\brief FullGraph and SymFullGraph classes.
    1.20  
    1.21  
    1.22 -#include <lemon/invalid.h>
    1.23 -
    1.24  namespace lemon {
    1.25  
    1.26  /// \addtogroup graphs
    1.27 @@ -58,6 +58,9 @@
    1.28      //    FullGraphBase(const FullGraphBase &_g)
    1.29      //      : NodeNum(_g.nodeNum()), EdgeNum(NodeNum*NodeNum) { }
    1.30      
    1.31 +    typedef True NodeNumTag;
    1.32 +    typedef True EdgeNumTag;
    1.33 +
    1.34      ///Number of nodes.
    1.35      int nodeNum() const { return NodeNum; }
    1.36      ///Number of edges.
    1.37 @@ -206,21 +209,9 @@
    1.38      FullGraph(int n) { construct(n); }
    1.39    };
    1.40  
    1.41 -  template <>
    1.42 -  int countNodes<FullGraph>(const FullGraph& graph) {
    1.43 -    return graph.nodeNum();
    1.44 -  }
    1.45 -
    1.46 -  template <>
    1.47 -  int countEdges<FullGraph>(const FullGraph& graph) {
    1.48 -    return graph.edgeNum();
    1.49 -  }
    1.50 -
    1.51    /// @}  
    1.52  
    1.53  } //namespace lemon
    1.54  
    1.55  
    1.56 -
    1.57 -
    1.58  #endif //LEMON_FULL_GRAPH_H