1.1 --- a/lemon/list_graph.h	Tue Jul 12 13:36:01 2005 +0000
     1.2 +++ b/lemon/list_graph.h	Tue Jul 12 16:15:37 2005 +0000
     1.3 @@ -275,7 +275,7 @@
     1.4      }
     1.5  
     1.6    protected:
     1.7 -    void _moveTarget(Edge e, Node n) 
     1.8 +    void _changeTarget(Edge e, Node n) 
     1.9      {
    1.10        if(edges[e.id].next_in != -1)
    1.11  	edges[edges[e.id].next_in].prev_in = edges[e.id].prev_in;
    1.12 @@ -287,7 +287,7 @@
    1.13        edges[e.id].next_in = nodes[n.id].first_in;
    1.14        nodes[n.id].first_in = e.id;
    1.15      }
    1.16 -    void _moveSource(Edge e, Node n) 
    1.17 +    void _changeSource(Edge e, Node n) 
    1.18      {
    1.19        if(edges[e.id].next_out != -1)
    1.20  	edges[edges[e.id].next_out].prev_out = edges[e.id].prev_out;
    1.21 @@ -324,32 +324,32 @@
    1.22    class ListGraph : public ErasableListGraphBase 
    1.23    {
    1.24    public:
    1.25 -    /// Moves the target of \c e to \c n
    1.26 +    /// Changes the target of \c e to \c n
    1.27  
    1.28 -    /// Moves the target of \c e to \c n
    1.29 +    /// Changes the target of \c e to \c n
    1.30      ///
    1.31      ///\note The <tt>Edge</tt>'s and <tt>OutEdge</tt>'s
    1.32 -    ///referencing the moved edge remain
    1.33 +    ///referencing the changed edge remain
    1.34      ///valid. However <tt>InEdge</tt>'s are invalidated.
    1.35 -    void moveTarget(Edge e, Node n) { _moveTarget(e,n); }
    1.36 -    /// Moves the source of \c e to \c n
    1.37 +    void changeTarget(Edge e, Node n) { _changeTarget(e,n); }
    1.38 +    /// Changes the source of \c e to \c n
    1.39  
    1.40 -    /// Moves the source of \c e to \c n
    1.41 +    /// Changes the source of \c e to \c n
    1.42      ///
    1.43      ///\note The <tt>Edge</tt>'s and <tt>InEdge</tt>'s
    1.44 -    ///referencing the moved edge remain
    1.45 +    ///referencing the changed edge remain
    1.46      ///valid. However <tt>OutEdge</tt>'s are invalidated.
    1.47 -    void moveSource(Edge e, Node n) { _moveSource(e,n); }
    1.48 +    void changeSource(Edge e, Node n) { _changeSource(e,n); }
    1.49  
    1.50      /// Invert the direction of an edge.
    1.51  
    1.52      ///\note The <tt>Edge</tt>'s
    1.53 -    ///referencing the moved edge remain
    1.54 +    ///referencing the changed edge remain
    1.55      ///valid. However <tt>OutEdge</tt>'s  and <tt>InEdge</tt>'s are invalidated.
    1.56      void reverseEdge(Edge e) {
    1.57        Node t=target(e);
    1.58 -      _moveTarget(e,source(e));
    1.59 -      _moveSource(e,t);
    1.60 +      _changeTarget(e,source(e));
    1.61 +      _changeSource(e,t);
    1.62      }
    1.63  
    1.64      ///Using this it possible to avoid the superfluous memory allocation.
    1.65 @@ -377,14 +377,14 @@
    1.66  	OutEdgeIt f=e;
    1.67  	++f;
    1.68  	if(r && target(e)==a) erase(e);
    1.69 -	else moveSource(e,a);
    1.70 +	else changeSource(e,a);
    1.71  	e=f;
    1.72        }
    1.73        for(InEdgeIt e(*this,b);e!=INVALID;) {
    1.74  	InEdgeIt f=e;
    1.75  	++f;
    1.76  	if(r && source(e)==a) erase(e);
    1.77 -	else moveTarget(e,a);
    1.78 +	else changeTarget(e,a);
    1.79  	e=f;
    1.80        }
    1.81        erase(b);
    1.82 @@ -411,7 +411,7 @@
    1.83        for(OutEdgeIt e(*this,n);e!=INVALID;) {
    1.84   	OutEdgeIt f=e;
    1.85  	++f;
    1.86 -	moveSource(e,b);
    1.87 +	changeSource(e,b);
    1.88  	e=f;
    1.89        }
    1.90        if(connect) addEdge(n,b);
    1.91 @@ -559,7 +559,7 @@
    1.92    ///
    1.93    ///\sa concept::UndirGraph.
    1.94    ///
    1.95 -  ///\todo SnapShot, reverseEdge(), moveTarget(), moveSource(), contract()
    1.96 +  ///\todo SnapShot, reverseEdge(), changeTarget(), changeSource(), contract()
    1.97    ///haven't been implemented yet.
    1.98    ///
    1.99    class UndirListGraph : public ErasableUndirListGraphBase {