1.1 --- a/doc/graphs.dox Sat Nov 13 12:24:01 2004 +0000
1.2 +++ b/doc/graphs.dox Sat Nov 13 12:53:28 2004 +0000
1.3 @@ -125,7 +125,7 @@
1.4 \code
1.5 std::cout << "Edges:";
1.6 for (EdgeIt i(g); i!=INVALID; ++i)
1.7 - std::cout << " (" << g.id(g.tail(i)) << "," << g.id(g.head(i)) << ")";
1.8 + std::cout << " (" << g.id(g.source(i)) << "," << g.id(g.target(i)) << ")";
1.9 std::cout << std::endl;
1.10 \endcode
1.11
1.12 @@ -133,20 +133,20 @@
1.13 Edges: (0,2) (1,2) (0,1) (2,1) (1,0) (2,0)
1.14 \endcode
1.15
1.16 -We can also iterate through all edges of the graph very similarly. The head and
1.17 -tail member functions can be used to access the endpoints of an edge.
1.18 +We can also iterate through all edges of the graph very similarly. The target and
1.19 +source member functions can be used to access the endpoints of an edge.
1.20
1.21 \code
1.22 NodeIt first_node(g);
1.23
1.24 std::cout << "Out-edges of node " << g.id(first_node) << ":";
1.25 for (OutEdgeIt i(g, first_node); i!=INVALID; ++i)
1.26 - std::cout << " (" << g.id(g.tail(i)) << "," << g.id(g.head(i)) << ")";
1.27 + std::cout << " (" << g.id(g.source(i)) << "," << g.id(g.target(i)) << ")";
1.28 std::cout << std::endl;
1.29
1.30 std::cout << "In-edges of node " << g.id(first_node) << ":";
1.31 for (InEdgeIt i(g, first_node); i!=INVALID; ++i)
1.32 - std::cout << " (" << g.id(g.tail(i)) << "," << g.id(g.head(i)) << ")";
1.33 + std::cout << " (" << g.id(g.source(i)) << "," << g.id(g.target(i)) << ")";
1.34 std::cout << std::endl;
1.35 \endcode
1.36
1.37 @@ -166,7 +166,7 @@
1.38
1.39 std::cout << "Id Edge Value" << std::endl;
1.40 for (EdgeIt e(g); e!=INVALID; ++e)
1.41 - std::cout << g.id(e) << " (" << g.id(g.tail(e)) << "," << g.id(g.head(e))
1.42 + std::cout << g.id(e) << " (" << g.id(g.source(e)) << "," << g.id(g.target(e))
1.43 << ") " << m[e] << std::endl;
1.44 \endcode
1.45