1.1 --- a/src/hugo/smart_graph.h	Tue Jul 20 09:52:03 2004 +0000
     1.2 +++ b/src/hugo/smart_graph.h	Tue Jul 20 10:58:11 2004 +0000
     1.3 @@ -136,21 +136,21 @@
     1.4  //     template< typename It >
     1.5  //     It first(Node v) const { It e; first(e,v); return e; }
     1.6  
     1.7 -    bool valid(Edge e) const { return e.n!=-1; }
     1.8 -    bool valid(Node n) const { return n.n!=-1; }
     1.9 +    static bool valid(Edge e) { return e.n!=-1; }
    1.10 +    static bool valid(Node n) { return n.n!=-1; }
    1.11      
    1.12      ///\deprecated Use
    1.13      ///\code
    1.14      ///  e=INVALID;
    1.15      ///\endcode
    1.16      ///instead.
    1.17 -    void setInvalid(Edge &e) { e.n=-1; }
    1.18 +    static void setInvalid(Edge &e) { e.n=-1; }
    1.19      ///\deprecated Use
    1.20      ///\code
    1.21      ///  e=INVALID;
    1.22      ///\endcode
    1.23      ///instead.
    1.24 -    void setInvalid(Node &n) { n.n=-1; }
    1.25 +    static void setInvalid(Node &n) { n.n=-1; }
    1.26      
    1.27      template <typename It> It getNext(It it) const
    1.28      { It tmp(it); return next(tmp); }
    1.29 @@ -165,8 +165,8 @@
    1.30      { it.n=edges[it.n].next_in; return it; }
    1.31      EdgeIt& next(EdgeIt& it) const { --it.n; return it; }
    1.32  
    1.33 -    int id(Node v) const { return v.n; }
    1.34 -    int id(Edge e) const { return e.n; }
    1.35 +    static int id(Node v) { return v.n; }
    1.36 +    static int id(Edge e) { return e.n; }
    1.37  
    1.38      Node addNode() {
    1.39        Node n; n.n=nodes.size();
    1.40 @@ -503,7 +503,7 @@
    1.41  
    1.42      ///Returns the oppositely directed
    1.43      ///pair of the edge \c e.
    1.44 -    Edge opposite(Edge e) const
    1.45 +    static Edge opposite(Edge e)
    1.46      {
    1.47        Edge f;
    1.48        f.idref() = e.idref() - 2*(e.idref()%2) + 1;