# HG changeset patch
# User Alpar Juttner <alpar@cs.elte.hu>
# Date 1220179756 -7200
# Node ID 43500afd5cb0d289b21dd0056c0a41142dc4d683
# Parent  dbe309b5e8558542297b2415f7b8ea5e4eced62f# Parent  66644b9cd9ebca91a7267b7b0aeefcfc490327d4
Merge

diff -r dbe309b5e855 -r 43500afd5cb0 lemon/bfs.h
--- a/lemon/bfs.h	Sat Aug 30 22:19:43 2008 +0200
+++ b/lemon/bfs.h	Sun Aug 31 12:49:16 2008 +0200
@@ -1262,6 +1262,11 @@
   /// class. It works with callback mechanism, the BfsVisit object calls
   /// the member functions of the \c Visitor class on every BFS event.
   ///
+  /// This interface of the BFS algorithm should be used in special cases
+  /// when extra actions have to be performed in connection with certain
+  /// events of the BFS algorithm. Otherwise consider to use Bfs or bfs()
+  /// instead.
+  ///
   /// \tparam _Digraph The type of the digraph the algorithm runs on.
   /// The default value is
   /// \ref ListDigraph. The value of _Digraph is not used directly by
diff -r dbe309b5e855 -r 43500afd5cb0 lemon/dfs.h
--- a/lemon/dfs.h	Sat Aug 30 22:19:43 2008 +0200
+++ b/lemon/dfs.h	Sun Aug 31 12:49:16 2008 +0200
@@ -1209,6 +1209,11 @@
   /// class. It works with callback mechanism, the DfsVisit object calls
   /// the member functions of the \c Visitor class on every DFS event.
   ///
+  /// This interface of the DFS algorithm should be used in special cases
+  /// when extra actions have to be performed in connection with certain
+  /// events of the DFS algorithm. Otherwise consider to use Dfs or dfs()
+  /// instead.
+  ///
   /// \tparam _Digraph The type of the digraph the algorithm runs on.
   /// The default value is
   /// \ref ListDigraph. The value of _Digraph is not used directly by