1.1 --- a/lemon/dfs.h Thu May 10 14:56:05 2007 +0000
1.2 +++ b/lemon/dfs.h Fri May 11 16:02:53 2007 +0000
1.3 @@ -564,9 +564,9 @@
1.4 ///with addSource() before using this function.
1.5 ///
1.6 ///\param em must be a bool (or convertible) edge map. The algorithm
1.7 - ///will stop when it reaches an edge \c e with <tt>em[e]==true<\tt>.
1.8 + ///will stop when it reaches an edge \c e with <tt>em[e]<\tt> true.
1.9 ///
1.10 - ///\return The reached edge \c e with <tt>em[e]==true<\tt> or
1.11 + ///\return The reached edge \c e with <tt>em[e]<\tt> true or
1.12 ///\c INVALID if no such edge was found.
1.13 ///
1.14 ///\warning Contrary to \ref Bfs and \ref Dijkstra, \c em is an edge map,
1.15 @@ -1458,9 +1458,9 @@
1.16 /// with addSource() before using this function.
1.17 ///
1.18 /// \param em must be a bool (or convertible) edge map. The algorithm
1.19 - /// will stop when it reaches an edge \c e with <tt>em[e]==true<\tt>.
1.20 + /// will stop when it reaches an edge \c e with <tt>em[e]<\tt> true.
1.21 ///
1.22 - ///\return The reached edge \c e with <tt>em[e]==true<\tt> or
1.23 + ///\return The reached edge \c e with <tt>em[e]<\tt> true or
1.24 ///\c INVALID if no such edge was found.
1.25 ///
1.26 /// \warning Contrary to \ref Bfs and \ref Dijkstra, \c em is an edge map,