1.1 --- a/src/hugo/list_graph.h	Thu Jul 15 17:56:34 2004 +0000
     1.2 +++ b/src/hugo/list_graph.h	Mon Jul 19 13:29:32 2004 +0000
     1.3 @@ -349,8 +349,13 @@
     1.4        int n;
     1.5        friend int ListGraph::id(Edge e) const;
     1.6  
     1.7 +    public:
     1.8 +      /// An Edge with id \c n.
     1.9 +
    1.10 +      /// \bug It should be
    1.11 +      /// obtained by a member function of the Graph.
    1.12        Edge(int nn) {n=nn;}
    1.13 -    public:
    1.14 +
    1.15        Edge() { }
    1.16        Edge (Invalid) { n=-1; }
    1.17        bool operator==(const Edge i) const {return n==i.n;}

     2.1 --- a/src/hugo/smart_graph.h	Thu Jul 15 17:56:34 2004 +0000
     2.2 +++ b/src/hugo/smart_graph.h	Mon Jul 19 13:29:32 2004 +0000
     2.3 @@ -237,8 +237,12 @@
     2.4        int n;
     2.5        friend int SmartGraph::id(Edge e) const;
     2.6  
     2.7 +    public:
     2.8 +      /// An Edge with id \c n.
     2.9 +
    2.10 +      /// \bug It should be
    2.11 +      /// obtained by a member function of the Graph.
    2.12        Edge(int nn) {n=nn;}
    2.13 -    public:
    2.14        Edge() { }
    2.15        Edge (Invalid) { n=-1; }
    2.16        bool operator==(const Edge i) const {return n==i.n;}