119 ///algorithm, which is convenient in the simplier cases and it can be |
119 ///algorithm, which is convenient in the simplier cases and it can be |
120 ///used easier. |
120 ///used easier. |
121 /// |
121 /// |
122 ///\tparam GR The type of the digraph the algorithm runs on. |
122 ///\tparam GR The type of the digraph the algorithm runs on. |
123 ///The default type is \ref ListDigraph. |
123 ///The default type is \ref ListDigraph. |
|
124 ///\tparam TR The traits class that defines various types used by the |
|
125 ///algorithm. By default, it is \ref DfsDefaultTraits |
|
126 ///"DfsDefaultTraits<GR>". |
|
127 ///In most cases, this parameter should not be set directly, |
|
128 ///consider to use the named template parameters instead. |
124 #ifdef DOXYGEN |
129 #ifdef DOXYGEN |
125 template <typename GR, |
130 template <typename GR, |
126 typename TR> |
131 typename TR> |
127 #else |
132 #else |
128 template <typename GR=ListDigraph, |
133 template <typename GR=ListDigraph, |
885 /// It does not have own \ref run(Node) "run()" method, it uses the |
890 /// It does not have own \ref run(Node) "run()" method, it uses the |
886 /// functions and features of the plain \ref Dfs. |
891 /// functions and features of the plain \ref Dfs. |
887 /// |
892 /// |
888 /// This class should only be used through the \ref dfs() function, |
893 /// This class should only be used through the \ref dfs() function, |
889 /// which makes it easier to use the algorithm. |
894 /// which makes it easier to use the algorithm. |
|
895 /// |
|
896 /// \tparam TR The traits class that defines various types used by the |
|
897 /// algorithm. |
890 template<class TR> |
898 template<class TR> |
891 class DfsWizard : public TR |
899 class DfsWizard : public TR |
892 { |
900 { |
893 typedef TR Base; |
901 typedef TR Base; |
894 |
902 |
1235 /// it is only passed to \ref DfsVisitDefaultTraits. |
1243 /// it is only passed to \ref DfsVisitDefaultTraits. |
1236 /// \tparam VS The Visitor type that is used by the algorithm. |
1244 /// \tparam VS The Visitor type that is used by the algorithm. |
1237 /// \ref DfsVisitor "DfsVisitor<GR>" is an empty visitor, which |
1245 /// \ref DfsVisitor "DfsVisitor<GR>" is an empty visitor, which |
1238 /// does not observe the DFS events. If you want to observe the DFS |
1246 /// does not observe the DFS events. If you want to observe the DFS |
1239 /// events, you should implement your own visitor class. |
1247 /// events, you should implement your own visitor class. |
1240 /// \tparam TR Traits class to set various data types used by the |
1248 /// \tparam TR The traits class that defines various types used by the |
1241 /// algorithm. The default traits class is |
1249 /// algorithm. By default, it is \ref DfsVisitDefaultTraits |
1242 /// \ref DfsVisitDefaultTraits "DfsVisitDefaultTraits<GR>". |
1250 /// "DfsVisitDefaultTraits<GR>". |
1243 /// See \ref DfsVisitDefaultTraits for the documentation of |
1251 /// In most cases, this parameter should not be set directly, |
1244 /// a DFS visit traits class. |
1252 /// consider to use the named template parameters instead. |
1245 #ifdef DOXYGEN |
1253 #ifdef DOXYGEN |
1246 template <typename GR, typename VS, typename TR> |
1254 template <typename GR, typename VS, typename TR> |
1247 #else |
1255 #else |
1248 template <typename GR = ListDigraph, |
1256 template <typename GR = ListDigraph, |
1249 typename VS = DfsVisitor<GR>, |
1257 typename VS = DfsVisitor<GR>, |