Changeset 604:4acd273c3009 in lemon0.x
 Timestamp:
 05/11/04 13:42:02 (16 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@785
 Location:
 src/work
 Files:

 3 edited
Legend:
 Unmodified
 Added
 Removed

src/work/Doxyfile
r583 r604 398 398 klao/path.h \ 399 399 jacint/max_flow.h \ 400 jacint/max_matching.h 400 jacint/max_matching.h \ 401 marci/bfs_dfs.h \ 402 marci/bfs_dfs_misc.h \ 403 jacint/graph_gen.h 401 404 402 405 # If the value of the INPUT tag contains directories, you can use the 
src/work/marci/bfs_dfs.h
r602 r604 2 2 #ifndef HUGO_BFS_DFS_H 3 3 #define HUGO_BFS_DFS_H 4 5 // ///\ingroup gwrappers 6 ///\file 7 ///\brief Bfs and dfs iterators. 8 /// 9 ///This file contains bfs and dfs iterator classes. 10 /// 11 // ///\author Marton Makai 4 12 5 13 #include <queue> … … 38 46 graph(&_graph), reached(*(new ReachedMap(*graph /*, false*/))), 39 47 own_reached_map(true) { } 40 /// The storing the reached nodes have to be destroyed if48 /// The map storing the reached nodes have to be destroyed if 41 49 /// it was constructed dynamically 42 50 ~BfsIterator() { if (own_reached_map) delete &reached; } … … 162 170 /// Beside the bfs iteration, \c pred and \dist are saved in a 163 171 /// newly reached node. 164 Bfs<Graph, ReachedMap, PredMap, DistMap> operator++() {172 Bfs<Graph, ReachedMap, PredMap, DistMap>& operator++() { 165 173 Parent::operator++(); 166 174 if (this>graph>valid(this>actual_edge) && this>b_node_newly_reached) … … 297 305 /// Beside the dfs iteration, \c pred is saved in a 298 306 /// newly reached node. 299 Dfs<Graph, ReachedMap, PredMap> operator++() {307 Dfs<Graph, ReachedMap, PredMap>& operator++() { 300 308 Parent::operator++(); 301 309 if (this>graph>valid(this>actual_edge) && this>b_node_newly_reached) 
src/work/marci/bfs_dfs_misc.h
r602 r604 2 2 #ifndef HUGO_BFS_DFS_MISC_H 3 3 #define HUGO_BFS_DFS_MISC_H 4 5 // ///\ingroup gwrappers 6 ///\file 7 ///\brief Miscellaneous algorithms using bfs and dfs. 8 /// 9 ///This file contains several algorithms using bfs and dfs. 10 /// 11 // ///\author Marton Makai 4 12 5 13 #include <bfs_dfs.h>
Note: See TracChangeset
for help on using the changeset viewer.