1.1 --- a/src/hugo/list_graph.h	Thu Jul 15 15:31:24 2004 +0000
     1.2 +++ b/src/hugo/list_graph.h	Thu Jul 15 17:56:34 2004 +0000
     1.3 @@ -1166,6 +1166,10 @@
     1.4  
     1.5    public:
     1.6      class Node;
     1.7 +    class Edge;
     1.8 +    class OutEdgeIt;
     1.9 +    class InEdgeIt;
    1.10 +    class SymEdge;
    1.11      int id(Node v) const; 
    1.12  
    1.13      class Node : public NodeGraphType::Node {
    1.14 @@ -1558,8 +1562,6 @@
    1.15   	G->dyn_edge_maps.push_back(this);
    1.16        }
    1.17  
    1.18 -      template<typename TT> friend class EdgeMap;
    1.19 -
    1.20        ///\todo It can copy between different types.
    1.21        ///
    1.22        template<typename TT> EdgeMap(const EdgeMap<TT> &m) :