# HG changeset patch
# User marci
# Date 1084275722 0
# Node ID 4acd273c300947b6e22ebc1dc5534541aef4a574
# Parent  86458ad390a7eae2224e8c017318bd75ffa2f8f2
some docs

diff -r 86458ad390a7 -r 4acd273c3009 src/work/Doxyfile
--- a/src/work/Doxyfile	Tue May 11 09:30:06 2004 +0000
+++ b/src/work/Doxyfile	Tue May 11 11:42:02 2004 +0000
@@ -397,7 +397,10 @@
                          athos/minlengthpaths.h \
                          klao/path.h \
                          jacint/max_flow.h \
-                         jacint/max_matching.h
+                         jacint/max_matching.h \ 
+			 marci/bfs_dfs.h \
+	  		 marci/bfs_dfs_misc.h \
+			 jacint/graph_gen.h
 
 # If the value of the INPUT tag contains directories, you can use the 
 # FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp 
diff -r 86458ad390a7 -r 4acd273c3009 src/work/marci/bfs_dfs.h
--- a/src/work/marci/bfs_dfs.h	Tue May 11 09:30:06 2004 +0000
+++ b/src/work/marci/bfs_dfs.h	Tue May 11 11:42:02 2004 +0000
@@ -2,6 +2,14 @@
 #ifndef HUGO_BFS_DFS_H
 #define HUGO_BFS_DFS_H
 
+// ///\ingroup gwrappers
+///\file
+///\brief Bfs and dfs iterators.
+///
+///This file contains bfs and dfs iterator classes.
+///
+// ///\author Marton Makai
+
 #include <queue>
 #include <stack>
 #include <utility>
@@ -37,7 +45,7 @@
     BfsIterator(const Graph& _graph) : 
       graph(&_graph), reached(*(new ReachedMap(*graph /*, false*/))), 
       own_reached_map(true) { }
-    /// The storing the reached nodes have to be destroyed if 
+    /// The map storing the reached nodes have to be destroyed if 
     /// it was constructed dynamically
     ~BfsIterator() { if (own_reached_map) delete &reached; }
     /// This method markes \c s reached.
@@ -161,7 +169,7 @@
     }
     /// Beside the bfs iteration, \c pred and \dist are saved in a 
     /// newly reached node. 
-    Bfs<Graph, ReachedMap, PredMap, DistMap> operator++() {
+    Bfs<Graph, ReachedMap, PredMap, DistMap>& operator++() {
       Parent::operator++();
       if (this->graph->valid(this->actual_edge) && this->b_node_newly_reached) 
       {
@@ -296,7 +304,7 @@
     }
     /// Beside the dfs iteration, \c pred is saved in a 
     /// newly reached node. 
-    Dfs<Graph, ReachedMap, PredMap> operator++() {
+    Dfs<Graph, ReachedMap, PredMap>& operator++() {
       Parent::operator++();
       if (this->graph->valid(this->actual_edge) && this->b_node_newly_reached) 
       {
diff -r 86458ad390a7 -r 4acd273c3009 src/work/marci/bfs_dfs_misc.h
--- a/src/work/marci/bfs_dfs_misc.h	Tue May 11 09:30:06 2004 +0000
+++ b/src/work/marci/bfs_dfs_misc.h	Tue May 11 11:42:02 2004 +0000
@@ -2,6 +2,14 @@
 #ifndef HUGO_BFS_DFS_MISC_H
 #define HUGO_BFS_DFS_MISC_H
 
+// ///\ingroup gwrappers
+///\file
+///\brief Miscellaneous algorithms using bfs and dfs.
+///
+///This file contains several algorithms using bfs and dfs.
+///
+// ///\author Marton Makai
+
 #include <bfs_dfs.h>
 #include <for_each_macros.h>