1.1 --- a/lemon/bfs.h	Wed Mar 17 12:35:52 2010 +0100
     1.2 +++ b/lemon/bfs.h	Sat Mar 06 14:35:12 2010 +0000
     1.3 @@ -2,7 +2,7 @@
     1.4   *
     1.5   * This file is a part of LEMON, a generic C++ optimization library.
     1.6   *
     1.7 - * Copyright (C) 2003-2009
     1.8 + * Copyright (C) 2003-2010
     1.9   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.10   * (Egervary Research Group on Combinatorial Optimization, EGRES).
    1.11   *
    1.12 @@ -82,7 +82,8 @@
    1.13      ///The type of the map that indicates which nodes are reached.
    1.14  
    1.15      ///The type of the map that indicates which nodes are reached.
    1.16 -    ///It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
    1.17 +    ///It must conform to
    1.18 +    ///the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
    1.19      typedef typename Digraph::template NodeMap<bool> ReachedMap;
    1.20      ///Instantiates a \c ReachedMap.
    1.21  
    1.22 @@ -271,7 +272,8 @@
    1.23      ///
    1.24      ///\ref named-templ-param "Named parameter" for setting
    1.25      ///\c ReachedMap type.
    1.26 -    ///It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
    1.27 +    ///It must conform to
    1.28 +    ///the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
    1.29      template <class T>
    1.30      struct SetReachedMap : public Bfs< Digraph, SetReachedMapTraits<T> > {
    1.31        typedef Bfs< Digraph, SetReachedMapTraits<T> > Create;
    1.32 @@ -872,7 +874,8 @@
    1.33      ///The type of the map that indicates which nodes are reached.
    1.34  
    1.35      ///The type of the map that indicates which nodes are reached.
    1.36 -    ///It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
    1.37 +    ///It must conform to
    1.38 +    ///the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
    1.39      typedef typename Digraph::template NodeMap<bool> ReachedMap;
    1.40      ///Instantiates a ReachedMap.
    1.41  
    1.42 @@ -1265,7 +1268,8 @@
    1.43      /// \brief The type of the map that indicates which nodes are reached.
    1.44      ///
    1.45      /// The type of the map that indicates which nodes are reached.
    1.46 -    /// It must conform to the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
    1.47 +    /// It must conform to
    1.48 +    ///the \ref concepts::ReadWriteMap "ReadWriteMap" concept.
    1.49      typedef typename Digraph::template NodeMap<bool> ReachedMap;
    1.50  
    1.51      /// \brief Instantiates a ReachedMap.