1.1 --- a/lemon/maps.h Fri May 29 17:46:48 2009 +0100
1.2 +++ b/lemon/maps.h Sun Aug 02 12:40:20 2009 +0200
1.3 @@ -1790,11 +1790,11 @@
1.4 /// order of Dfs algorithm, as the following examples show.
1.5 /// \code
1.6 /// std::vector<Node> v;
1.7 - /// dfs(g,s).processedMap(loggerBoolMap(std::back_inserter(v))).run();
1.8 + /// dfs(g).processedMap(loggerBoolMap(std::back_inserter(v))).run(s);
1.9 /// \endcode
1.10 /// \code
1.11 /// std::vector<Node> v(countNodes(g));
1.12 - /// dfs(g,s).processedMap(loggerBoolMap(v.begin())).run();
1.13 + /// dfs(g).processedMap(loggerBoolMap(v.begin())).run(s);
1.14 /// \endcode
1.15 ///
1.16 /// \note The container of the iterator must contain enough space