Changeset 986:e997802b855c in lemon-0.x for doc/graphs.dox

Timestamp:

11/13/04 13:53:28 (20 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1376

Message:

Naming changes:

• head -> target
• tail -> source

File:

• doc/graphs.dox (modified) (4 diffs)

doc/graphs.dox

@@ -126 +126 @@
   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
@@ -134 +134 @@
 \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
@@ -142 +142 @@
   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
@@ -167 +167 @@
   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