1.1 --- a/lemon/bfs.h	Sat May 17 06:30:02 2008 +0100
     1.2 +++ b/lemon/bfs.h	Sat May 24 23:20:49 2008 +0200
     1.3 @@ -37,7 +37,7 @@
     1.4    ///Default traits class of Bfs class.
     1.5  
     1.6    ///Default traits class of Bfs class.
     1.7 -  ///\param GR Digraph type.
     1.8 +  ///\tparam GR Digraph type.
     1.9    template<class GR>
    1.10    struct BfsDefaultTraits
    1.11    {
    1.12 @@ -115,16 +115,14 @@
    1.13    ///\ingroup search
    1.14    ///This class provides an efficient implementation of the %BFS algorithm.
    1.15    ///
    1.16 -  ///\param GR The digraph type the algorithm runs on. The default value is
    1.17 +  ///\tparam GR The digraph type the algorithm runs on. The default value is
    1.18    ///\ref ListDigraph. The value of GR is not used directly by Bfs, it
    1.19    ///is only passed to \ref BfsDefaultTraits.
    1.20 -  ///\param TR Traits class to set various data types used by the algorithm.
    1.21 +  ///\tparam TR Traits class to set various data types used by the algorithm.
    1.22    ///The default traits class is
    1.23    ///\ref BfsDefaultTraits "BfsDefaultTraits<GR>".
    1.24    ///See \ref BfsDefaultTraits for the documentation of
    1.25    ///a Bfs traits class.
    1.26 -  ///
    1.27 -  ///\author Alpar Juttner
    1.28  
    1.29  #ifdef DOXYGEN
    1.30    template <typename GR,
    1.31 @@ -756,7 +754,7 @@
    1.32    ///Default traits class of Bfs function.
    1.33  
    1.34    ///Default traits class of Bfs function.
    1.35 -  ///\param GR Digraph type.
    1.36 +  ///\tparam GR Digraph type.
    1.37    template<class GR>
    1.38    struct BfsWizardDefaultTraits
    1.39    {
    1.40 @@ -1165,7 +1163,7 @@
    1.41    /// \brief Default traits class of BfsVisit class.
    1.42    ///
    1.43    /// Default traits class of BfsVisit class.
    1.44 -  /// \param _Digraph Digraph type.
    1.45 +  /// \tparam _Digraph Digraph type.
    1.46    template<class _Digraph>
    1.47    struct BfsVisitDefaultTraits {
    1.48  
    1.49 @@ -1201,20 +1199,18 @@
    1.50    /// class. It works with callback mechanism, the BfsVisit object calls
    1.51    /// on every bfs event the \c Visitor class member functions. 
    1.52    ///
    1.53 -  /// \param _Digraph The digraph type the algorithm runs on. The default value is
    1.54 +  /// \tparam _Digraph The digraph type the algorithm runs on. The default value is
    1.55    /// \ref ListDigraph. The value of _Digraph is not used directly by Bfs, it
    1.56    /// is only passed to \ref BfsDefaultTraits.
    1.57 -  /// \param _Visitor The Visitor object for the algorithm. The 
    1.58 +  /// \tparam _Visitor The Visitor object for the algorithm. The 
    1.59    /// \ref BfsVisitor "BfsVisitor<_Digraph>" is an empty Visitor which
    1.60    /// does not observe the Bfs events. If you want to observe the bfs
    1.61    /// events you should implement your own Visitor class.
    1.62 -  /// \param _Traits Traits class to set various data types used by the 
    1.63 +  /// \tparam _Traits Traits class to set various data types used by the 
    1.64    /// algorithm. The default traits class is
    1.65    /// \ref BfsVisitDefaultTraits "BfsVisitDefaultTraits<_Digraph>".
    1.66    /// See \ref BfsVisitDefaultTraits for the documentation of
    1.67    /// a Bfs visit traits class.
    1.68 -  ///
    1.69 -  /// \author Jacint Szabo, Alpar Juttner and Balazs Dezso
    1.70  #ifdef DOXYGEN
    1.71    template <typename _Digraph, typename _Visitor, typename _Traits>
    1.72  #else