1.1 --- a/lemon/dfs.h Sat May 17 06:30:02 2008 +0100
1.2 +++ b/lemon/dfs.h Sat May 24 23:20:49 2008 +0200
1.3 @@ -38,7 +38,7 @@
1.4 ///Default traits class of Dfs class.
1.5
1.6 ///Default traits class of Dfs class.
1.7 - ///\param GR Digraph type.
1.8 + ///\tparam GR Digraph type.
1.9 template<class GR>
1.10 struct DfsDefaultTraits
1.11 {
1.12 @@ -117,16 +117,14 @@
1.13 ///\ingroup search
1.14 ///This class provides an efficient implementation of the %DFS 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 Dfs, it
1.19 ///is only passed to \ref DfsDefaultTraits.
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 DfsDefaultTraits "DfsDefaultTraits<GR>".
1.24 ///See \ref DfsDefaultTraits for the documentation of
1.25 ///a Dfs traits class.
1.26 - ///
1.27 - ///\author Jacint Szabo and Alpar Juttner
1.28 #ifdef DOXYGEN
1.29 template <typename GR,
1.30 typename TR>
1.31 @@ -739,7 +737,7 @@
1.32 ///Default traits class of Dfs function.
1.33
1.34 ///Default traits class of Dfs function.
1.35 - ///\param GR Digraph type.
1.36 + ///\tparam GR Digraph type.
1.37 template<class GR>
1.38 struct DfsWizardDefaultTraits
1.39 {
1.40 @@ -1160,7 +1158,7 @@
1.41 /// \brief Default traits class of DfsVisit class.
1.42 ///
1.43 /// Default traits class of DfsVisit class.
1.44 - /// \param _Digraph Digraph type.
1.45 + /// \tparam _Digraph Digraph type.
1.46 template<class _Digraph>
1.47 struct DfsVisitDefaultTraits {
1.48
1.49 @@ -1195,14 +1193,14 @@
1.50 /// class. It works with callback mechanism, the DfsVisit object calls
1.51 /// on every dfs 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 Dfs, it
1.56 /// is only passed to \ref DfsDefaultTraits.
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 DfsVisitor "DfsVisitor<_Digraph>" is an empty Visitor which
1.60 /// does not observe the Dfs events. If you want to observe the dfs
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 DfsVisitDefaultTraits "DfsVisitDefaultTraits<_Digraph>".
1.66 /// See \ref DfsVisitDefaultTraits for the documentation of