1.1 --- a/lemon/dijkstra.h	Wed Sep 26 14:37:48 2007 +0000
     1.2 +++ b/lemon/dijkstra.h	Thu Sep 27 13:04:06 2007 +0000
     1.3 @@ -665,7 +665,7 @@
     1.4      ///\param nm must be a bool (or convertible) node map. The algorithm
     1.5      ///will stop when it reaches a node \c v with <tt>nm[v]</tt> true.
     1.6      ///
     1.7 -    ///\return The reached node \c v with <tt>nm[v]<\tt> true or
     1.8 +    ///\return The reached node \c v with <tt>nm[v]</tt> true or
     1.9      ///\c INVALID if no such node was found.
    1.10      template<class NodeBoolMap>
    1.11      Node start(const NodeBoolMap &nm)