1.1 --- a/lemon/full_graph.h	Tue Sep 29 10:39:20 2009 +0200
     1.2 +++ b/lemon/full_graph.h	Tue Sep 29 13:03:34 2009 +0200
     1.3 @@ -51,7 +51,7 @@
     1.4      typedef True ArcNumTag;
     1.5  
     1.6      Node operator()(int ix) const { return Node(ix); }
     1.7 -    int index(const Node& node) const { return node._id; }
     1.8 +    static int index(const Node& node) { return node._id; }
     1.9  
    1.10      Arc arc(const Node& s, const Node& t) const {
    1.11        return Arc(s._id * _node_num + t._id);
    1.12 @@ -209,7 +209,7 @@
    1.13      /// digraph its nodes can be indexed with integers from the range
    1.14      /// <tt>[0..nodeNum()-1]</tt>.
    1.15      /// \sa operator()
    1.16 -    int index(const Node& node) const { return Parent::index(node); }
    1.17 +    static int index(const Node& node) { return Parent::index(node); }
    1.18  
    1.19      /// \brief Returns the arc connecting the given nodes.
    1.20      ///
    1.21 @@ -283,7 +283,7 @@
    1.22    public:
    1.23  
    1.24      Node operator()(int ix) const { return Node(ix); }
    1.25 -    int index(const Node& node) const { return node._id; }
    1.26 +    static int index(const Node& node) { return node._id; }
    1.27  
    1.28      Edge edge(const Node& u, const Node& v) const {
    1.29        if (u._id < v._id) {
    1.30 @@ -580,7 +580,7 @@
    1.31      /// graph its nodes can be indexed with integers from the range
    1.32      /// <tt>[0..nodeNum()-1]</tt>.
    1.33      /// \sa operator()
    1.34 -    int index(const Node& node) const { return Parent::index(node); }
    1.35 +    static int index(const Node& node) { return Parent::index(node); }
    1.36  
    1.37      /// \brief Returns the arc connecting the given nodes.
    1.38      ///