1.1 --- a/src/lemon/concept/graph_component.h	Sat Nov 13 12:24:01 2004 +0000
     1.2 +++ b/src/lemon/concept/graph_component.h	Sat Nov 13 12:53:28 2004 +0000
     1.3 @@ -242,17 +242,17 @@
     1.4  	bool operator<(const Edge&) const { return true;}
     1.5        };
     1.6  
     1.7 -      ///Gives back the head node of an edge.
     1.8 +      ///Gives back the target node of an edge.
     1.9  
    1.10 -      ///Gives back the head node of an edge.
    1.11 +      ///Gives back the target node of an edge.
    1.12        ///
    1.13 -      Node head(const Edge&) const { return INVALID;}
    1.14 +      Node target(const Edge&) const { return INVALID;}
    1.15  
    1.16 -      ///Gives back the tail node of an edge.
    1.17 +      ///Gives back the source node of an edge.
    1.18  
    1.19 -      ///Gives back the tail node of an edge.
    1.20 +      ///Gives back the source node of an edge.
    1.21        ///
    1.22 -      Node tail(const Edge&) const { return INVALID;}
    1.23 +      Node source(const Edge&) const { return INVALID;}
    1.24      };
    1.25  
    1.26  
    1.27 @@ -272,8 +272,8 @@
    1.28  	{
    1.29  	  Node n;
    1.30  	  Edge e;
    1.31 -	  n = graph.tail(e);
    1.32 -	  n = graph.head(e);
    1.33 +	  n = graph.source(e);
    1.34 +	  n = graph.target(e);
    1.35  	}      
    1.36        }
    1.37