diff -r 741f3108a90f -r e997802b855c src/lemon/concept/graph.h
--- a/src/lemon/concept/graph.h	Sat Nov 13 12:24:01 2004 +0000
+++ b/src/lemon/concept/graph.h	Sat Nov 13 12:53:28 2004 +0000
@@ -363,16 +363,16 @@
 //       ///
 //       EdgeIt& first(EdgeIt& i) const { return i; }
 
-//       ///Gives back the head node of an edge.
+//       ///Gives back the target node of an edge.
 
-//       ///Gives back the head node of an edge.
+//       ///Gives back the target node of an edge.
 //       ///
-//       Node head(Edge) const { return INVALID; }
-//       ///Gives back the tail node of an edge.
+//       Node target(Edge) const { return INVALID; }
+//       ///Gives back the source node of an edge.
 
-//       ///Gives back the tail node of an edge.
+//       ///Gives back the source node of an edge.
 //       ///
-//       Node tail(Edge) const { return INVALID; }
+//       Node source(Edge) const { return INVALID; }
   
 //       ///Gives back the \e id of a node.
 
@@ -538,8 +538,8 @@
 // 	n=m=INVALID;
 // 	Edge e;
 // 	e=INVALID;
-// 	n=G.tail(e);
-// 	n=G.head(e);
+// 	n=G.source(e);
+// 	n=G.target(e);
 //       }
 //       // id tests
 //       { Node n; int i=G.id(n); i=i; }
@@ -665,8 +665,8 @@
 //       Node addNode() { return INVALID; }
 //       ///Add a new edge to the graph.
 
-//       ///Add a new edge to the graph with tail node \c t
-//       ///and head node \c h.
+//       ///Add a new edge to the graph with source node \c t
+//       ///and target node \c h.
 //       ///\return the new edge.
 //       Edge addEdge(Node h, Node t) { return INVALID; }
     
@@ -800,8 +800,8 @@
       void nextOutEdge(Edge &e) const { }
       void nextInEdge(Edge &e) const { }
 
-      Node head(Edge) const { return Node(); }
-      Node tail(Edge) const { return Node(); }
+      Node target(Edge) const { return Node(); }
+      Node source(Edge) const { return Node(); }
       
 
       // Do we need id, nodeNum, edgeNum and co. in this basic graphbase