1.1 --- a/lemon/list_graph.h	Thu Jan 26 06:44:22 2006 +0000
     1.2 +++ b/lemon/list_graph.h	Thu Jan 26 15:42:13 2006 +0000
     1.3 @@ -19,7 +19,7 @@
     1.4  
     1.5  ///\ingroup graphs
     1.6  ///\file
     1.7 -///\brief ListGraph, UndirListGraph classes.
     1.8 +///\brief ListGraph, ListUGraph classes.
     1.9  
    1.10  #include <lemon/bits/erasable_graph_extender.h>
    1.11  #include <lemon/bits/clearable_graph_extender.h>
    1.12 @@ -576,13 +576,13 @@
    1.13  
    1.14    /**************** Undirected List Graph ****************/
    1.15  
    1.16 -  typedef ErasableUndirGraphExtender<
    1.17 -    ClearableUndirGraphExtender<
    1.18 -    ExtendableUndirGraphExtender<
    1.19 -    MappableUndirGraphExtender<
    1.20 -    IterableUndirGraphExtender<
    1.21 -    AlterableUndirGraphExtender<
    1.22 -    UndirGraphExtender<ListGraphBase> > > > > > > ExtendedUndirListGraphBase;
    1.23 +  typedef ErasableUGraphExtender<
    1.24 +    ClearableUGraphExtender<
    1.25 +    ExtendableUGraphExtender<
    1.26 +    MappableUGraphExtender<
    1.27 +    IterableUGraphExtender<
    1.28 +    AlterableUGraphExtender<
    1.29 +    UGraphExtender<ListGraphBase> > > > > > > ExtendedListUGraphBase;
    1.30  
    1.31    /// \addtogroup graphs
    1.32    /// @{
    1.33 @@ -592,16 +592,16 @@
    1.34    ///This is a simple and fast erasable undirected graph implementation.
    1.35    ///
    1.36    ///It conforms to the
    1.37 -  ///\ref concept::UndirGraph "UndirGraph" concept.
    1.38 +  ///\ref concept::UGraph "UGraph" concept.
    1.39    ///
    1.40 -  ///\sa concept::UndirGraph.
    1.41 +  ///\sa concept::UGraph.
    1.42    ///
    1.43    ///\todo Snapshot, reverseEdge(), changeTarget(), changeSource(), contract()
    1.44    ///haven't been implemented yet.
    1.45    ///
    1.46 -  class UndirListGraph : public ExtendedUndirListGraphBase {
    1.47 +  class ListUGraph : public ExtendedListUGraphBase {
    1.48    public:
    1.49 -    typedef ExtendedUndirListGraphBase Parent;
    1.50 +    typedef ExtendedListUGraphBase Parent;
    1.51      /// \brief Changes the target of \c e to \c n
    1.52      ///
    1.53      /// Changes the target of \c e to \c n
    1.54 @@ -609,7 +609,7 @@
    1.55      /// \note The <tt>Edge</tt>'s and <tt>OutEdge</tt>'s
    1.56      /// referencing the changed edge remain
    1.57      /// valid. However <tt>InEdge</tt>'s are invalidated.
    1.58 -    void changeTarget(UndirEdge e, Node n) { 
    1.59 +    void changeTarget(UEdge e, Node n) { 
    1.60        _changeTarget(e,n); 
    1.61      }
    1.62      /// Changes the source of \c e to \c n
    1.63 @@ -619,7 +619,7 @@
    1.64      ///\note The <tt>Edge</tt>'s and <tt>InEdge</tt>'s
    1.65      ///referencing the changed edge remain
    1.66      ///valid. However <tt>OutEdge</tt>'s are invalidated.
    1.67 -    void changeSource(UndirEdge e, Node n) { 
    1.68 +    void changeSource(UEdge e, Node n) { 
    1.69        _changeSource(e,n); 
    1.70      }
    1.71      /// \brief Contract two nodes.