1.1 --- a/lemon/dfs.h Wed Feb 10 19:05:20 2010 +0100
1.2 +++ b/lemon/dfs.h Fri Feb 12 22:24:26 2010 +0100
1.3 @@ -121,6 +121,11 @@
1.4 ///
1.5 ///\tparam GR The type of the digraph the algorithm runs on.
1.6 ///The default type is \ref ListDigraph.
1.7 + ///\tparam TR The traits class that defines various types used by the
1.8 + ///algorithm. By default, it is \ref DfsDefaultTraits
1.9 + ///"DfsDefaultTraits<GR>".
1.10 + ///In most cases, this parameter should not be set directly,
1.11 + ///consider to use the named template parameters instead.
1.12 #ifdef DOXYGEN
1.13 template <typename GR,
1.14 typename TR>
1.15 @@ -887,6 +892,9 @@
1.16 ///
1.17 /// This class should only be used through the \ref dfs() function,
1.18 /// which makes it easier to use the algorithm.
1.19 + ///
1.20 + /// \tparam TR The traits class that defines various types used by the
1.21 + /// algorithm.
1.22 template<class TR>
1.23 class DfsWizard : public TR
1.24 {
1.25 @@ -1237,11 +1245,11 @@
1.26 /// \ref DfsVisitor "DfsVisitor<GR>" is an empty visitor, which
1.27 /// does not observe the DFS events. If you want to observe the DFS
1.28 /// events, you should implement your own visitor class.
1.29 - /// \tparam TR Traits class to set various data types used by the
1.30 - /// algorithm. The default traits class is
1.31 - /// \ref DfsVisitDefaultTraits "DfsVisitDefaultTraits<GR>".
1.32 - /// See \ref DfsVisitDefaultTraits for the documentation of
1.33 - /// a DFS visit traits class.
1.34 + /// \tparam TR The traits class that defines various types used by the
1.35 + /// algorithm. By default, it is \ref DfsVisitDefaultTraits
1.36 + /// "DfsVisitDefaultTraits<GR>".
1.37 + /// In most cases, this parameter should not be set directly,
1.38 + /// consider to use the named template parameters instead.
1.39 #ifdef DOXYGEN
1.40 template <typename GR, typename VS, typename TR>
1.41 #else