| ... | ... |
@@ -1253,24 +1253,29 @@ |
| 1253 | 1253 |
|
| 1254 | 1254 |
/// \ingroup search |
| 1255 | 1255 |
/// |
| 1256 | 1256 |
/// \brief %BFS algorithm class with visitor interface. |
| 1257 | 1257 |
/// |
| 1258 | 1258 |
/// This class provides an efficient implementation of the %BFS algorithm |
| 1259 | 1259 |
/// with visitor interface. |
| 1260 | 1260 |
/// |
| 1261 | 1261 |
/// The %BfsVisit class provides an alternative interface to the Bfs |
| 1262 | 1262 |
/// class. It works with callback mechanism, the BfsVisit object calls |
| 1263 | 1263 |
/// the member functions of the \c Visitor class on every BFS event. |
| 1264 | 1264 |
/// |
| 1265 |
/// This interface of the BFS algorithm should be used in special cases |
|
| 1266 |
/// when extra actions have to be performed in connection with certain |
|
| 1267 |
/// events of the BFS algorithm. Otherwise consider to use Bfs or bfs() |
|
| 1268 |
/// instead. |
|
| 1269 |
/// |
|
| 1265 | 1270 |
/// \tparam _Digraph The type of the digraph the algorithm runs on. |
| 1266 | 1271 |
/// The default value is |
| 1267 | 1272 |
/// \ref ListDigraph. The value of _Digraph is not used directly by |
| 1268 | 1273 |
/// \ref BfsVisit, it is only passed to \ref BfsVisitDefaultTraits. |
| 1269 | 1274 |
/// \tparam _Visitor The Visitor type that is used by the algorithm. |
| 1270 | 1275 |
/// \ref BfsVisitor "BfsVisitor<_Digraph>" is an empty visitor, which |
| 1271 | 1276 |
/// does not observe the BFS events. If you want to observe the BFS |
| 1272 | 1277 |
/// events, you should implement your own visitor class. |
| 1273 | 1278 |
/// \tparam _Traits Traits class to set various data types used by the |
| 1274 | 1279 |
/// algorithm. The default traits class is |
| 1275 | 1280 |
/// \ref BfsVisitDefaultTraits "BfsVisitDefaultTraits<_Digraph>". |
| 1276 | 1281 |
/// See \ref BfsVisitDefaultTraits for the documentation of |
| ... | ... |
@@ -1200,24 +1200,29 @@ |
| 1200 | 1200 |
|
| 1201 | 1201 |
/// \ingroup search |
| 1202 | 1202 |
/// |
| 1203 | 1203 |
/// \brief %DFS algorithm class with visitor interface. |
| 1204 | 1204 |
/// |
| 1205 | 1205 |
/// This class provides an efficient implementation of the %DFS algorithm |
| 1206 | 1206 |
/// with visitor interface. |
| 1207 | 1207 |
/// |
| 1208 | 1208 |
/// The %DfsVisit class provides an alternative interface to the Dfs |
| 1209 | 1209 |
/// class. It works with callback mechanism, the DfsVisit object calls |
| 1210 | 1210 |
/// the member functions of the \c Visitor class on every DFS event. |
| 1211 | 1211 |
/// |
| 1212 |
/// This interface of the DFS algorithm should be used in special cases |
|
| 1213 |
/// when extra actions have to be performed in connection with certain |
|
| 1214 |
/// events of the DFS algorithm. Otherwise consider to use Dfs or dfs() |
|
| 1215 |
/// instead. |
|
| 1216 |
/// |
|
| 1212 | 1217 |
/// \tparam _Digraph The type of the digraph the algorithm runs on. |
| 1213 | 1218 |
/// The default value is |
| 1214 | 1219 |
/// \ref ListDigraph. The value of _Digraph is not used directly by |
| 1215 | 1220 |
/// \ref DfsVisit, it is only passed to \ref DfsVisitDefaultTraits. |
| 1216 | 1221 |
/// \tparam _Visitor The Visitor type that is used by the algorithm. |
| 1217 | 1222 |
/// \ref DfsVisitor "DfsVisitor<_Digraph>" is an empty visitor, which |
| 1218 | 1223 |
/// does not observe the DFS events. If you want to observe the DFS |
| 1219 | 1224 |
/// events, you should implement your own visitor class. |
| 1220 | 1225 |
/// \tparam _Traits Traits class to set various data types used by the |
| 1221 | 1226 |
/// algorithm. The default traits class is |
| 1222 | 1227 |
/// \ref DfsVisitDefaultTraits "DfsVisitDefaultTraits<_Digraph>". |
| 1223 | 1228 |
/// See \ref DfsVisitDefaultTraits for the documentation of |
0 comments (0 inline)