Changeset 604:4acd273c3009 in lemon-0.x for src/work

Timestamp:

05/11/04 13:42:02 (21 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@785

Message:

some docs

Location:

src/work

Files:

• Doxyfile (modified) (1 diff)
• marci/bfs_dfs.h (modified) (4 diffs)
• marci/bfs_dfs_misc.h (modified) (1 diff)

src/work/Doxyfile

@@ -398 +398 @@
                          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 

src/work/marci/bfs_dfs.h

@@ -2 +2 @@
 #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>
@@ -38 +46 @@
       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; }
@@ -162 +170 @@
     /// 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) 
@@ -297 +305 @@
     /// 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) 

src/work/marci/bfs_dfs_misc.h

@@ -2 +2 @@
 #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>