1.1 --- a/lemon/grid_graph.h	Thu Jan 26 06:44:22 2006 +0000
     1.2 +++ b/lemon/grid_graph.h	Thu Jan 26 15:42:13 2006 +0000
     1.3 @@ -338,10 +338,10 @@
     1.4    };
     1.5  
     1.6  
     1.7 -  typedef StaticMappableUndirGraphExtender<
     1.8 -    IterableUndirGraphExtender<
     1.9 -    AlterableUndirGraphExtender<
    1.10 -    UndirGraphExtender<GridGraphBase> > > > ExtendedGridGraphBase;
    1.11 +  typedef StaticMappableUGraphExtender<
    1.12 +    IterableUGraphExtender<
    1.13 +    AlterableUGraphExtender<
    1.14 +    UGraphExtender<GridGraphBase> > > > ExtendedGridGraphBase;
    1.15  
    1.16    /// \ingroup graphs
    1.17    ///
    1.18 @@ -364,7 +364,7 @@
    1.19    /// }
    1.20    /// \endcode
    1.21    ///
    1.22 -  /// The graph type is fully conform to the \ref concept::UndirGraph
    1.23 +  /// The graph type is fully conform to the \ref concept::UGraph
    1.24    /// "Undirected Graph" concept.
    1.25    ///
    1.26    /// \author Balazs Dezso
    1.27 @@ -463,7 +463,7 @@
    1.28      /// Gives back the edge goes down from the node. If there is not
    1.29      /// outgoing edge then it gives back INVALID.
    1.30      Edge down(Node n) const {
    1.31 -      UndirEdge ue = _down(n);
    1.32 +      UEdge ue = _down(n);
    1.33        return ue != INVALID ? direct(ue, true) : INVALID;
    1.34      }
    1.35      
    1.36 @@ -472,7 +472,7 @@
    1.37      /// Gives back the edge goes up from the node. If there is not
    1.38      /// outgoing edge then it gives back INVALID.
    1.39      Edge up(Node n) const {
    1.40 -      UndirEdge ue = _up(n);
    1.41 +      UEdge ue = _up(n);
    1.42        return ue != INVALID ? direct(ue, false) : INVALID;
    1.43      }
    1.44  
    1.45 @@ -481,7 +481,7 @@
    1.46      /// Gives back the edge goes right from the node. If there is not
    1.47      /// outgoing edge then it gives back INVALID.
    1.48      Edge right(Node n) const {
    1.49 -      UndirEdge ue = _right(n);
    1.50 +      UEdge ue = _right(n);
    1.51        return ue != INVALID ? direct(ue, true) : INVALID;
    1.52      }
    1.53  
    1.54 @@ -490,7 +490,7 @@
    1.55      /// Gives back the edge goes left from the node. If there is not
    1.56      /// outgoing edge then it gives back INVALID.
    1.57      Edge left(Node n) const {
    1.58 -      UndirEdge ue = _left(n);
    1.59 +      UEdge ue = _left(n);
    1.60        return ue != INVALID ? direct(ue, false) : INVALID;
    1.61      }
    1.62