1.1 --- a/lemon/dijkstra.h	Thu May 10 14:56:05 2007 +0000
     1.2 +++ b/lemon/dijkstra.h	Fri May 11 16:02:53 2007 +0000
     1.3 @@ -663,9 +663,9 @@
     1.4      ///with addSource() before using this function.
     1.5      ///
     1.6      ///\param nm must be a bool (or convertible) node map. The algorithm
     1.7 -    ///will stop when it reaches a node \c v with <tt>nm[v]==true</tt>.
     1.8 +    ///will stop when it reaches a node \c v with <tt>nm[v]</tt> true.
     1.9      ///
    1.10 -    ///\return The reached node \c v with <tt>nm[v]==true<\tt> or
    1.11 +    ///\return The reached node \c v with <tt>nm[v]<\tt> true or
    1.12      ///\c INVALID if no such node was found.
    1.13      template<class NodeBoolMap>
    1.14      Node start(const NodeBoolMap &nm)