1.1 --- a/doc/Doxyfile.in	Tue Jul 30 15:54:46 2013 +0200
     1.2 +++ b/doc/Doxyfile.in	Mon Aug 05 14:03:29 2013 +0200
     1.3 @@ -99,8 +99,7 @@
     1.4                           "@abs_top_srcdir@/contrib" \
     1.5                           "@abs_top_srcdir@/tools" \
     1.6                           "@abs_top_srcdir@/test/test_tools.h" \
     1.7 -                         "@abs_top_builddir@/doc/mainpage.dox" \
     1.8 -                         "@abs_top_builddir@/doc/references.dox"
     1.9 +                         "@abs_top_builddir@/doc/mainpage.dox"
    1.10  INPUT_ENCODING         = UTF-8
    1.11  FILE_PATTERNS          = *.h \
    1.12                           *.cc \

     2.1 --- a/doc/lgf.dox	Tue Jul 30 15:54:46 2013 +0200
     2.2 +++ b/doc/lgf.dox	Mon Aug 05 14:03:29 2013 +0200
     2.3 @@ -64,7 +64,7 @@
     2.4  \endcode
     2.5  
     2.6  The \e LGF files can also contain bipartite graphs, in this case a
     2.7 -\c @red_nodes and a \c @blue_nodes sections describe the node set of the
     2.8 +\c \@red_nodes and a \c \@blue_nodes sections describe the node set of the
     2.9  graph. If a map is in both of these sections, then it can be used as a
    2.10  regular node map.
    2.11  

     3.1 --- a/lemon/bellman_ford.h	Tue Jul 30 15:54:46 2013 +0200
     3.2 +++ b/lemon/bellman_ford.h	Mon Aug 05 14:03:29 2013 +0200
     3.3 @@ -200,11 +200,12 @@
     3.4      typedef typename TR::DistMap DistMap;
     3.5      /// The type of the paths.
     3.6      typedef PredMapPath<Digraph, PredMap> Path;
     3.7 -    ///\brief The \ref BellmanFordDefaultOperationTraits
     3.8 +    ///\brief The \ref lemon::BellmanFordDefaultOperationTraits
     3.9      /// "operation traits class" of the algorithm.
    3.10      typedef typename TR::OperationTraits OperationTraits;
    3.11  
    3.12 -    ///The \ref BellmanFordDefaultTraits "traits class" of the algorithm.
    3.13 +    ///\brief The \ref lemon::BellmanFordDefaultTraits "traits class"
    3.14 +    ///of the algorithm.
    3.15      typedef TR Traits;
    3.16  
    3.17    private:

     4.1 --- a/lemon/bfs.h	Tue Jul 30 15:54:46 2013 +0200
     4.2 +++ b/lemon/bfs.h	Mon Aug 05 14:03:29 2013 +0200
     4.3 @@ -152,7 +152,7 @@
     4.4      ///The type of the paths.
     4.5      typedef PredMapPath<Digraph, PredMap> Path;
     4.6  
     4.7 -    ///The \ref BfsDefaultTraits "traits class" of the algorithm.
     4.8 +    ///The \ref lemon::BfsDefaultTraits "traits class" of the algorithm.
     4.9      typedef TR Traits;
    4.10  
    4.11    private:

     5.1 --- a/lemon/capacity_scaling.h	Tue Jul 30 15:54:46 2013 +0200
     5.2 +++ b/lemon/capacity_scaling.h	Mon Aug 05 14:03:29 2013 +0200
     5.3 @@ -118,7 +118,8 @@
     5.4      /// The type of the heap used for internal Dijkstra computations
     5.5      typedef typename TR::Heap Heap;
     5.6  
     5.7 -    /// The \ref CapacityScalingDefaultTraits "traits class" of the algorithm
     5.8 +    /// \brief The \ref lemon::CapacityScalingDefaultTraits "traits class"
     5.9 +    /// of the algorithm
    5.10      typedef TR Traits;
    5.11  
    5.12    public:

     6.1 --- a/lemon/christofides_tsp.h	Tue Jul 30 15:54:46 2013 +0200
     6.2 +++ b/lemon/christofides_tsp.h	Mon Aug 05 14:03:29 2013 +0200
     6.3 @@ -231,7 +231,7 @@
     6.4        /// \brief Gives back the found tour as a path.
     6.5        ///
     6.6        /// This function copies the found tour as a list of arcs/edges into
     6.7 -      /// the given \ref concept::Path "path structure".
     6.8 +      /// the given \ref lemon::concepts::Path "path structure".
     6.9        ///
    6.10        /// \pre run() must be called before using this function.
    6.11        template <typename Path>

     7.1 --- a/lemon/circulation.h	Tue Jul 30 15:54:46 2013 +0200
     7.2 +++ b/lemon/circulation.h	Mon Aug 05 14:03:29 2013 +0200
     7.3 @@ -195,7 +195,8 @@
     7.4    class Circulation {
     7.5    public:
     7.6  
     7.7 -    ///The \ref CirculationDefaultTraits "traits class" of the algorithm.
     7.8 +    /// \brief The \ref lemon::CirculationDefaultTraits "traits class"
     7.9 +    /// of the algorithm.
    7.10      typedef TR Traits;
    7.11      ///The type of the digraph the algorithm runs on.
    7.12      typedef typename Traits::Digraph Digraph;

     8.1 --- a/lemon/cost_scaling.h	Tue Jul 30 15:54:46 2013 +0200
     8.2 +++ b/lemon/cost_scaling.h	Mon Aug 05 14:03:29 2013 +0200
     8.3 @@ -152,7 +152,8 @@
     8.4      /// otherwise it is \c double.
     8.5      typedef typename TR::LargeCost LargeCost;
     8.6  
     8.7 -    /// The \ref CostScalingDefaultTraits "traits class" of the algorithm
     8.8 +    /// \brief The \ref lemon::CostScalingDefaultTraits "traits class"
     8.9 +    /// of the algorithm
    8.10      typedef TR Traits;
    8.11  
    8.12    public:

     9.1 --- a/lemon/cplex.h	Tue Jul 30 15:54:46 2013 +0200
     9.2 +++ b/lemon/cplex.h	Mon Aug 05 14:03:29 2013 +0200
     9.3 @@ -178,7 +178,7 @@
     9.4      /// This function writes the problem or the solution
     9.5      /// to a file in the given format.
     9.6      /// Trying to write in an unsupported format will trigger
     9.7 -    /// \ref UnsupportedFormatError.
     9.8 +    /// \ref lemon::LpBase::UnsupportedFormatError "UnsupportedFormatError".
     9.9      /// \param file The file path
    9.10      /// \param format The output file format.
    9.11      /// Supportted formats are "MPS", "LP" and "SOL".

    10.1 --- a/lemon/dfs.h	Tue Jul 30 15:54:46 2013 +0200
    10.2 +++ b/lemon/dfs.h	Mon Aug 05 14:03:29 2013 +0200
    10.3 @@ -152,7 +152,7 @@
    10.4      ///The type of the paths.
    10.5      typedef PredMapPath<Digraph, PredMap> Path;
    10.6  
    10.7 -    ///The \ref DfsDefaultTraits "traits class" of the algorithm.
    10.8 +    ///The \ref lemon::DfsDefaultTraits "traits class" of the algorithm.
    10.9      typedef TR Traits;
   10.10  
   10.11    private:

    11.1 --- a/lemon/dijkstra.h	Tue Jul 30 15:54:46 2013 +0200
    11.2 +++ b/lemon/dijkstra.h	Mon Aug 05 14:03:29 2013 +0200
    11.3 @@ -227,11 +227,11 @@
    11.4      typedef typename TR::HeapCrossRef HeapCrossRef;
    11.5      ///The heap type used by the algorithm.
    11.6      typedef typename TR::Heap Heap;
    11.7 -    ///\brief The \ref DijkstraDefaultOperationTraits "operation traits class"
    11.8 -    ///of the algorithm.
    11.9 +    /// \brief The \ref lemon::DijkstraDefaultOperationTraits
   11.10 +    /// "operation traits class" of the algorithm.
   11.11      typedef typename TR::OperationTraits OperationTraits;
   11.12  
   11.13 -    ///The \ref DijkstraDefaultTraits "traits class" of the algorithm.
   11.14 +    ///The \ref lemon::DijkstraDefaultTraits "traits class" of the algorithm.
   11.15      typedef TR Traits;
   11.16  
   11.17    private:

    12.1 --- a/lemon/edmonds_karp.h	Tue Jul 30 15:54:46 2013 +0200
    12.2 +++ b/lemon/edmonds_karp.h	Mon Aug 05 14:03:29 2013 +0200
    12.3 @@ -80,8 +80,8 @@
    12.4    ///
    12.5    /// This class provides an implementation of the \e Edmonds-Karp \e
    12.6    /// algorithm producing a \ref max_flow "flow of maximum value" in a
    12.7 -  /// digraph \ref clrs01algorithms, \ref amo93networkflows,
    12.8 -  /// \ref edmondskarp72theoretical.
    12.9 +  /// digraph \cite clrs01algorithms, \cite amo93networkflows,
   12.10 +  /// \cite edmondskarp72theoretical.
   12.11    /// The Edmonds-Karp algorithm is slower than the Preflow
   12.12    /// algorithm, but it has an advantage of the step-by-step execution
   12.13    /// control with feasible flow solutions. The \e source node, the \e
   12.14 @@ -112,7 +112,8 @@
   12.15    class EdmondsKarp {
   12.16    public:
   12.17  
   12.18 -    /// The \ref EdmondsKarpDefaultTraits "traits class" of the algorithm.
   12.19 +    /// \brief The \ref lemon::EdmondsKarpDefaultTraits "traits class"
   12.20 +    /// of the algorithm.
   12.21      typedef TR Traits;
   12.22      /// The type of the digraph the algorithm runs on.
   12.23      typedef typename Traits::Digraph Digraph;

    13.1 --- a/lemon/fractional_matching.h	Tue Jul 30 15:54:46 2013 +0200
    13.2 +++ b/lemon/fractional_matching.h	Mon Aug 05 14:03:29 2013 +0200
    13.3 @@ -123,8 +123,8 @@
    13.4    class MaxFractionalMatching {
    13.5    public:
    13.6  
    13.7 -    /// \brief The \ref MaxFractionalMatchingDefaultTraits "traits
    13.8 -    /// class" of the algorithm.
    13.9 +    /// \brief The \ref lemon::MaxFractionalMatchingDefaultTraits
   13.10 +    /// "traits class" of the algorithm.
   13.11      typedef TR Traits;
   13.12      /// The type of the graph the algorithm runs on.
   13.13      typedef typename TR::Graph Graph;

    14.1 --- a/lemon/glpk.h	Tue Jul 30 15:54:46 2013 +0200
    14.2 +++ b/lemon/glpk.h	Mon Aug 05 14:03:29 2013 +0200
    14.3 @@ -152,7 +152,7 @@
    14.4      /// This function writes the problem or the solution
    14.5      /// to a file in the given format.
    14.6      /// Trying to write in an unsupported format will trigger
    14.7 -    /// \ref UnsupportedFormatError.
    14.8 +    /// \ref LpBase::UnsupportedFormatError.
    14.9      /// \param file The file path
   14.10      /// \param format The output file format.
   14.11      /// Supportted formats are "MPS" and "LP".

    15.1 --- a/lemon/greedy_tsp.h	Tue Jul 30 15:54:46 2013 +0200
    15.2 +++ b/lemon/greedy_tsp.h	Mon Aug 05 14:03:29 2013 +0200
    15.3 @@ -228,7 +228,7 @@
    15.4        /// \brief Gives back the found tour as a path.
    15.5        ///
    15.6        /// This function copies the found tour as a list of arcs/edges into
    15.7 -      /// the given \ref concept::Path "path structure".
    15.8 +      /// the given \ref lemon::concepts::Path "path structure".
    15.9        ///
   15.10        /// \pre run() must be called before using this function.
   15.11        template <typename Path>

    16.1 --- a/lemon/hartmann_orlin_mmc.h	Tue Jul 30 15:54:46 2013 +0200
    16.2 +++ b/lemon/hartmann_orlin_mmc.h	Mon Aug 05 14:03:29 2013 +0200
    16.3 @@ -143,11 +143,14 @@
    16.4      /// \brief The path type of the found cycles
    16.5      ///
    16.6      /// The path type of the found cycles.
    16.7 -    /// Using the \ref HartmannOrlinMmcDefaultTraits "default traits class",
    16.8 +    /// Using the \ref lemon::HartmannOrlinMmcDefaultTraits
    16.9 +    /// "default traits class",
   16.10      /// it is \ref lemon::Path "Path<Digraph>".
   16.11      typedef typename TR::Path Path;
   16.12  
   16.13 -    /// The \ref HartmannOrlinMmcDefaultTraits "traits class" of the algorithm
   16.14 +    /// \brief The
   16.15 +    /// \ref lemon::HartmannOrlinMmcDefaultTraits "traits class"
   16.16 +    /// of the algorithm
   16.17      typedef TR Traits;
   16.18  
   16.19    private:

    17.1 --- a/lemon/howard_mmc.h	Tue Jul 30 15:54:46 2013 +0200
    17.2 +++ b/lemon/howard_mmc.h	Mon Aug 05 14:03:29 2013 +0200
    17.3 @@ -142,11 +142,11 @@
    17.4      /// \brief The path type of the found cycles
    17.5      ///
    17.6      /// The path type of the found cycles.
    17.7 -    /// Using the \ref HowardMmcDefaultTraits "default traits class",
    17.8 +    /// Using the \ref lemon::HowardMmcDefaultTraits "default traits class",
    17.9      /// it is \ref lemon::Path "Path<Digraph>".
   17.10      typedef typename TR::Path Path;
   17.11  
   17.12 -    /// The \ref HowardMmcDefaultTraits "traits class" of the algorithm
   17.13 +    /// The \ref lemon::HowardMmcDefaultTraits "traits class" of the algorithm
   17.14      typedef TR Traits;
   17.15  
   17.16      /// \brief Constants for the causes of search termination.

    18.1 --- a/lemon/insertion_tsp.h	Tue Jul 30 15:54:46 2013 +0200
    18.2 +++ b/lemon/insertion_tsp.h	Mon Aug 05 14:03:29 2013 +0200
    18.3 @@ -225,7 +225,7 @@
    18.4        /// \brief Gives back the found tour as a path.
    18.5        ///
    18.6        /// This function copies the found tour as a list of arcs/edges into
    18.7 -      /// the given \ref concept::Path "path structure".
    18.8 +      /// the given \ref lemon::concepts::Path "path structure".
    18.9        ///
   18.10        /// \pre run() must be called before using this function.
   18.11        template <typename Path>

    19.1 --- a/lemon/karp_mmc.h	Tue Jul 30 15:54:46 2013 +0200
    19.2 +++ b/lemon/karp_mmc.h	Mon Aug 05 14:03:29 2013 +0200
    19.3 @@ -140,11 +140,11 @@
    19.4      /// \brief The path type of the found cycles
    19.5      ///
    19.6      /// The path type of the found cycles.
    19.7 -    /// Using the \ref KarpMmcDefaultTraits "default traits class",
    19.8 +    /// Using the \ref lemon::KarpMmcDefaultTraits "default traits class",
    19.9      /// it is \ref lemon::Path "Path<Digraph>".
   19.10      typedef typename TR::Path Path;
   19.11  
   19.12 -    /// The \ref KarpMmcDefaultTraits "traits class" of the algorithm
   19.13 +    /// The \ref lemon::KarpMmcDefaultTraits "traits class" of the algorithm
   19.14      typedef TR Traits;
   19.15  
   19.16    private:

    20.1 --- a/lemon/lgf_reader.h	Tue Jul 30 15:54:46 2013 +0200
    20.2 +++ b/lemon/lgf_reader.h	Mon Aug 05 14:03:29 2013 +0200
    20.3 @@ -1230,9 +1230,10 @@
    20.4  
    20.5    /// \ingroup lemon_io
    20.6    ///
    20.7 -  /// \brief Return a \ref DigraphReader class
    20.8 +  /// \brief Return a \ref lemon::DigraphReader "DigraphReader" class
    20.9    ///
   20.10 -  /// This function just returns a \ref DigraphReader class.
   20.11 +  /// This function just returns a \ref lemon::DigraphReader
   20.12 +  /// "DigraphReader" class.
   20.13    ///
   20.14    /// With this function a digraph can be read from an
   20.15    /// \ref lgf-format "LGF" file or input stream with several maps and
   20.16 @@ -1252,9 +1253,10 @@
   20.17    ///  run();
   20.18    ///\endcode
   20.19    ///
   20.20 -  /// For a complete documentation, please see the \ref DigraphReader
   20.21 +  /// For a complete documentation, please see the
   20.22 +  /// \ref lemon::DigraphReader "DigraphReader"
   20.23    /// class documentation.
   20.24 -  /// \warning Don't forget to put the \ref DigraphReader::run() "run()"
   20.25 +  /// \warning Don't forget to put the \ref lemon::DigraphReader::run() "run()"
   20.26    /// to the end of the parameter list.
   20.27    /// \relates DigraphReader
   20.28    /// \sa digraphReader(TDGR& digraph, const std::string& fn)
   20.29 @@ -2108,9 +2110,9 @@
   20.30  
   20.31    /// \ingroup lemon_io
   20.32    ///
   20.33 -  /// \brief Return a \ref GraphReader class
   20.34 +  /// \brief Return a \ref lemon::GraphReader "GraphReader" class
   20.35    ///
   20.36 -  /// This function just returns a \ref GraphReader class.
   20.37 +  /// This function just returns a \ref lemon::GraphReader "GraphReader" class.
   20.38    ///
   20.39    /// With this function a graph can be read from an
   20.40    /// \ref lgf-format "LGF" file or input stream with several maps and
   20.41 @@ -2126,9 +2128,10 @@
   20.42    ///  run();
   20.43    ///\endcode
   20.44    ///
   20.45 -  /// For a complete documentation, please see the \ref GraphReader
   20.46 +  /// For a complete documentation, please see the
   20.47 +  /// \ref lemon::GraphReader "GraphReader"
   20.48    /// class documentation.
   20.49 -  /// \warning Don't forget to put the \ref GraphReader::run() "run()"
   20.50 +  /// \warning Don't forget to put the \ref lemon::GraphReader::run() "run()"
   20.51    /// to the end of the parameter list.
   20.52    /// \relates GraphReader
   20.53    /// \sa graphReader(TGR& graph, const std::string& fn)
   20.54 @@ -3174,9 +3177,10 @@
   20.55  
   20.56    /// \ingroup lemon_io
   20.57    ///
   20.58 -  /// \brief Return a \ref BpGraphReader class
   20.59 +  /// \brief Return a \ref lemon::BpGraphReader "BpGraphReader" class
   20.60    ///
   20.61 -  /// This function just returns a \ref BpGraphReader class.
   20.62 +  /// This function just returns a \ref lemon::BpGraphReader
   20.63 +  /// "BpGraphReader" class.
   20.64    ///
   20.65    /// With this function a graph can be read from an
   20.66    /// \ref lgf-format "LGF" file or input stream with several maps and
   20.67 @@ -3192,9 +3196,10 @@
   20.68    ///  run();
   20.69    ///\endcode
   20.70    ///
   20.71 -  /// For a complete documentation, please see the \ref BpGraphReader
   20.72 +  /// For a complete documentation, please see the
   20.73 +  /// \ref lemon::BpGraphReader "BpGraphReader"
   20.74    /// class documentation.
   20.75 -  /// \warning Don't forget to put the \ref BpGraphReader::run() "run()"
   20.76 +  /// \warning Don't forget to put the \ref lemon::BpGraphReader::run() "run()"
   20.77    /// to the end of the parameter list.
   20.78    /// \relates BpGraphReader
   20.79    /// \sa bpGraphReader(TBGR& graph, const std::string& fn)

    21.1 --- a/lemon/lgf_writer.h	Tue Jul 30 15:54:46 2013 +0200
    21.2 +++ b/lemon/lgf_writer.h	Mon Aug 05 14:03:29 2013 +0200
    21.3 @@ -944,9 +944,10 @@
    21.4  
    21.5    /// \ingroup lemon_io
    21.6    ///
    21.7 -  /// \brief Return a \ref DigraphWriter class
    21.8 +  /// \brief Return a \ref lemon::DigraphWriter "DigraphWriter" class
    21.9    ///
   21.10 -  /// This function just returns a \ref DigraphWriter class.
   21.11 +  /// This function just returns a \ref lemon::DigraphWriter
   21.12 +  /// "DigraphWriter" class.
   21.13    ///
   21.14    /// With this function a digraph can be write to a file or output
   21.15    /// stream in \ref lgf-format "LGF" format with several maps and
   21.16 @@ -967,9 +968,10 @@
   21.17    ///  run();
   21.18    ///\endcode
   21.19    ///
   21.20 -  /// For a complete documentation, please see the \ref DigraphWriter
   21.21 +  /// For a complete documentation, please see the
   21.22 +  /// \ref lemon::DigraphWriter "DigraphWriter"
   21.23    /// class documentation.
   21.24 -  /// \warning Don't forget to put the \ref DigraphWriter::run() "run()"
   21.25 +  /// \warning Don't forget to put the \ref lemon::DigraphWriter::run() "run()"
   21.26    /// to the end of the parameter list.
   21.27    /// \relates DigraphWriter
   21.28    /// \sa digraphWriter(const TDGR& digraph, const std::string& fn)
   21.29 @@ -1583,9 +1585,9 @@
   21.30  
   21.31    /// \ingroup lemon_io
   21.32    ///
   21.33 -  /// \brief Return a \ref GraphWriter class
   21.34 +  /// \brief Return a \ref lemon::GraphWriter "GraphWriter" class
   21.35    ///
   21.36 -  /// This function just returns a \ref GraphWriter class.
   21.37 +  /// This function just returns a \ref lemon::GraphWriter "GraphWriter" class.
   21.38    ///
   21.39    /// With this function a graph can be write to a file or output
   21.40    /// stream in \ref lgf-format "LGF" format with several maps and
   21.41 @@ -1602,9 +1604,10 @@
   21.42    ///  run();
   21.43    ///\endcode
   21.44    ///
   21.45 -  /// For a complete documentation, please see the \ref GraphWriter
   21.46 +  /// For a complete documentation, please see the
   21.47 +  /// \ref lemon::GraphWriter "GraphWriter"
   21.48    /// class documentation.
   21.49 -  /// \warning Don't forget to put the \ref GraphWriter::run() "run()"
   21.50 +  /// \warning Don't forget to put the \ref lemon::GraphWriter::run() "run()"
   21.51    /// to the end of the parameter list.
   21.52    /// \relates GraphWriter
   21.53    /// \sa graphWriter(const TGR& graph, const std::string& fn)
   21.54 @@ -2401,9 +2404,10 @@
   21.55  
   21.56    /// \ingroup lemon_io
   21.57    ///
   21.58 -  /// \brief Return a \ref BpGraphWriter class
   21.59 +  /// \brief Return a \ref lemon::BpGraphWriter "BpGraphWriter" class
   21.60    ///
   21.61 -  /// This function just returns a \ref BpGraphWriter class.
   21.62 +  /// This function just returns a \ref lemon::BpGraphWriter
   21.63 +  /// "BpGraphWriter" class.
   21.64    ///
   21.65    /// With this function a bipartite graph can be write to a file or output
   21.66    /// stream in \ref lgf-format "LGF" format with several maps and
   21.67 @@ -2420,9 +2424,10 @@
   21.68    ///  run();
   21.69    ///\endcode
   21.70    ///
   21.71 -  /// For a complete documentation, please see the \ref BpGraphWriter
   21.72 +  /// For a complete documentation, please see the
   21.73 +  /// \ref lemon::BpGraphWriter "BpGraphWriter"
   21.74    /// class documentation.
   21.75 -  /// \warning Don't forget to put the \ref BpGraphWriter::run() "run()"
   21.76 +  /// \warning Don't forget to put the \ref lemon::BpGraphWriter::run() "run()"
   21.77    /// to the end of the parameter list.
   21.78    /// \relates BpGraphWriter
   21.79    /// \sa bpGraphWriter(const TBGR& graph, const std::string& fn)

    22.1 --- a/lemon/lp_base.h	Tue Jul 30 15:54:46 2013 +0200
    22.2 +++ b/lemon/lp_base.h	Mon Aug 05 14:03:29 2013 +0200
    22.3 @@ -1007,7 +1007,7 @@
    22.4  
    22.5    public:
    22.6  
    22.7 -    ///\e
    22.8 +    ///\e \ 
    22.9      class UnsupportedFormatError : public Exception
   22.10      {
   22.11        std::string _format;

    23.1 --- a/lemon/min_cost_arborescence.h	Tue Jul 30 15:54:46 2013 +0200
    23.2 +++ b/lemon/min_cost_arborescence.h	Mon Aug 05 14:03:29 2013 +0200
    23.3 @@ -128,7 +128,7 @@
    23.4    class MinCostArborescence {
    23.5    public:
    23.6  
    23.7 -    /// \brief The \ref MinCostArborescenceDefaultTraits "traits class"
    23.8 +    /// \brief The \ref lemon::MinCostArborescenceDefaultTraits "traits class"
    23.9      /// of the algorithm.
   23.10      typedef TR Traits;
   23.11      /// The type of the underlying digraph.

    24.1 --- a/lemon/nearest_neighbor_tsp.h	Tue Jul 30 15:54:46 2013 +0200
    24.2 +++ b/lemon/nearest_neighbor_tsp.h	Mon Aug 05 14:03:29 2013 +0200
    24.3 @@ -215,7 +215,7 @@
    24.4        /// \brief Gives back the found tour as a path.
    24.5        ///
    24.6        /// This function copies the found tour as a list of arcs/edges into
    24.7 -      /// the given \ref concept::Path "path structure".
    24.8 +      /// the given \ref lemon::concepts::Path "path structure".
    24.9        ///
   24.10        /// \pre run() must be called before using this function.
   24.11        template <typename Path>

    25.1 --- a/lemon/opt2_tsp.h	Tue Jul 30 15:54:46 2013 +0200
    25.2 +++ b/lemon/opt2_tsp.h	Mon Aug 05 14:03:29 2013 +0200
    25.3 @@ -252,7 +252,7 @@
    25.4        /// \brief Gives back the found tour as a path.
    25.5        ///
    25.6        /// This function copies the found tour as a list of arcs/edges into
    25.7 -      /// the given \ref concept::Path "path structure".
    25.8 +      /// the given \ref lemon::concepts::Path "path structure".
    25.9        ///
   25.10        /// \pre run() must be called before using this function.
   25.11        template <typename Path>

    26.1 --- a/lemon/preflow.h	Tue Jul 30 15:54:46 2013 +0200
    26.2 +++ b/lemon/preflow.h	Mon Aug 05 14:03:29 2013 +0200
    26.3 @@ -134,7 +134,7 @@
    26.4    class Preflow {
    26.5    public:
    26.6  
    26.7 -    ///The \ref PreflowDefaultTraits "traits class" of the algorithm.
    26.8 +    ///The \ref lemon::PreflowDefaultTraits "traits class" of the algorithm.
    26.9      typedef TR Traits;
   26.10      ///The type of the digraph the algorithm runs on.
   26.11      typedef typename Traits::Digraph Digraph;

    27.1 --- a/lemon/suurballe.h	Tue Jul 30 15:54:46 2013 +0200
    27.2 +++ b/lemon/suurballe.h	Mon Aug 05 14:03:29 2013 +0200
    27.3 @@ -137,7 +137,7 @@
    27.4      /// The heap type used for internal Dijkstra computations.
    27.5      typedef typename TR::Heap Heap;
    27.6  
    27.7 -    /// The \ref SuurballeDefaultTraits "traits class" of the algorithm.
    27.8 +    /// The \ref lemon::SuurballeDefaultTraits "traits class" of the algorithm.
    27.9      typedef TR Traits;
   27.10  
   27.11    private: