1.1 --- a/lemon/list_graph.h	Fri Apr 24 10:15:33 2009 +0200
     1.2 +++ b/lemon/list_graph.h	Fri Apr 24 11:54:48 2009 +0200
     1.3 @@ -323,6 +323,8 @@
     1.4    ///\sa concepts::Digraph
     1.5  
     1.6    class ListDigraph : public ExtendedListDigraphBase {
     1.7 +    typedef ExtendedListDigraphBase Parent;
     1.8 +
     1.9    private:
    1.10      ///ListDigraph is \e not copy constructible. Use copyDigraph() instead.
    1.11  
    1.12 @@ -337,8 +339,6 @@
    1.13      void operator=(const ListDigraph &) {}
    1.14    public:
    1.15  
    1.16 -    typedef ExtendedListDigraphBase Parent;
    1.17 -
    1.18      /// Constructor
    1.19  
    1.20      /// Constructor.
    1.21 @@ -793,7 +793,7 @@
    1.22  
    1.23    public:
    1.24  
    1.25 -    typedef ListGraphBase Digraph;
    1.26 +    typedef ListGraphBase Graph;
    1.27  
    1.28      class Node;
    1.29      class Arc;
    1.30 @@ -1176,6 +1176,8 @@
    1.31    ///\sa concepts::Graph
    1.32  
    1.33    class ListGraph : public ExtendedListGraphBase {
    1.34 +    typedef ExtendedListGraphBase Parent;
    1.35 +
    1.36    private:
    1.37      ///ListGraph is \e not copy constructible. Use copyGraph() instead.
    1.38  
    1.39 @@ -1195,8 +1197,6 @@
    1.40      ///
    1.41      ListGraph() {}
    1.42  
    1.43 -    typedef ExtendedListGraphBase Parent;
    1.44 -
    1.45      typedef Parent::OutArcIt IncEdgeIt;
    1.46  
    1.47      /// \brief Add a new node to the graph.