1.1 --- a/src/work/alpar/smart_graph.h	Fri Mar 19 15:41:58 2004 +0000
     1.2 +++ b/src/work/alpar/smart_graph.h	Fri Mar 19 20:58:39 2004 +0000
     1.3 @@ -374,7 +374,7 @@
     1.4        void erase(const Node k) { }
     1.5        
     1.6        void set(Node n, T a) { container[n.n]=a; }
     1.7 -      T get(Node n) const { return container[n.n]; }
     1.8 +      //T get(Node n) const { return container[n.n]; }
     1.9        T& operator[](Node n) { return container[n.n]; }
    1.10        const T& operator[](Node n) const { return container[n.n]; }
    1.11  
    1.12 @@ -461,7 +461,7 @@
    1.13        void erase(const Edge k) { }
    1.14        
    1.15        void set(Edge n, T a) { container[n.n]=a; }
    1.16 -      T get(Edge n) const { return container[n.n]; }
    1.17 +      //T get(Edge n) const { return container[n.n]; }
    1.18        T& operator[](Edge n) { return container[n.n]; }
    1.19        const T& operator[](Edge n) const { return container[n.n]; }
    1.20  
    1.21 @@ -603,7 +603,7 @@
    1.22        void erase(const Edge k) { }
    1.23        
    1.24        void set(Edge n, T a) { container[n.idref()/2]=a; }
    1.25 -      T get(Edge n) const { return container[n.idref()/2]; }
    1.26 +      //T get(Edge n) const { return container[n.idref()/2]; }
    1.27        T& operator[](Edge n) { return container[n.idref()/2]; }
    1.28        const T& operator[](Edge n) const { return container[n.idref()/2]; }
    1.29