diff -r 741f3108a90f -r e997802b855c doc/graphs.dox
--- a/doc/graphs.dox	Sat Nov 13 12:24:01 2004 +0000
+++ b/doc/graphs.dox	Sat Nov 13 12:53:28 2004 +0000
@@ -125,7 +125,7 @@
 \code
   std::cout << "Edges:";
   for (EdgeIt i(g); i!=INVALID; ++i)
-    std::cout << " (" << g.id(g.tail(i)) << "," << g.id(g.head(i)) << ")";
+    std::cout << " (" << g.id(g.source(i)) << "," << g.id(g.target(i)) << ")";
   std::cout << std::endl;
 \endcode
 
@@ -133,20 +133,20 @@
 Edges: (0,2) (1,2) (0,1) (2,1) (1,0) (2,0)
 \endcode
 
-We can also iterate through all edges of the graph very similarly. The head and
-tail member functions can be used to access the endpoints of an edge.
+We can also iterate through all edges of the graph very similarly. The target and
+source member functions can be used to access the endpoints of an edge.
 
 \code
   NodeIt first_node(g);
 
   std::cout << "Out-edges of node " << g.id(first_node) << ":";
   for (OutEdgeIt i(g, first_node); i!=INVALID; ++i)
-    std::cout << " (" << g.id(g.tail(i)) << "," << g.id(g.head(i)) << ")"; 
+    std::cout << " (" << g.id(g.source(i)) << "," << g.id(g.target(i)) << ")"; 
   std::cout << std::endl;
 
   std::cout << "In-edges of node " << g.id(first_node) << ":";
   for (InEdgeIt i(g, first_node); i!=INVALID; ++i)
-    std::cout << " (" << g.id(g.tail(i)) << "," << g.id(g.head(i)) << ")"; 
+    std::cout << " (" << g.id(g.source(i)) << "," << g.id(g.target(i)) << ")"; 
   std::cout << std::endl;
 \endcode
 
@@ -166,7 +166,7 @@
   
   std::cout << "Id Edge  Value" << std::endl;
   for (EdgeIt e(g); e!=INVALID; ++e)
-    std::cout << g.id(e) << "  (" << g.id(g.tail(e)) << "," << g.id(g.head(e))
+    std::cout << g.id(e) << "  (" << g.id(g.source(e)) << "," << g.id(g.target(e))
       << ") " << m[e] << std::endl;
 \endcode