1.1 --- a/lemon/full_graph.h	Thu Aug 18 12:22:44 2005 +0000
     1.2 +++ b/lemon/full_graph.h	Thu Aug 18 13:33:49 2005 +0000
     1.3 @@ -125,10 +125,10 @@
     1.4  
     1.5      protected:
     1.6        int id;
     1.7 -      Node(int _id) { id = _id;}
     1.8 +      Node(int _id) : id(_id) {}
     1.9      public:
    1.10        Node() {}
    1.11 -      Node (Invalid) { id = -1; }
    1.12 +      Node (Invalid) : id(-1) {}
    1.13        bool operator==(const Node node) const {return id == node.id;}
    1.14        bool operator!=(const Node node) const {return id != node.id;}
    1.15        bool operator<(const Node node) const {return id < node.id;}
    1.16 @@ -260,12 +260,12 @@
    1.17  
    1.18      Node source(Edge e) const { 
    1.19        /// \todo we may do it faster
    1.20 -      return ((int)sqrt((double)(1 + 8 * e.id)) + 1) / 2; 
    1.21 +      return Node(((int)sqrt((double)(1 + 8 * e.id)) + 1) / 2);
    1.22      }
    1.23  
    1.24      Node target(Edge e) const { 
    1.25        int source = ((int)sqrt((double)(1 + 8 * e.id)) + 1) / 2;;
    1.26 -      return e.id - (source) * (source - 1) / 2; 
    1.27 +      return Node(e.id - (source) * (source - 1) / 2);
    1.28      }
    1.29  
    1.30