COIN-OR::LEMON - Graph Library

Changeset 604:4acd273c3009 in lemon-0.x


Ignore:
Timestamp:
05/11/04 13:42:02 (16 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:
3 edited

Legend:

Unmodified
Added
Removed
  • src/work/Doxyfile

    r583 r604  
    398398                         klao/path.h \
    399399                         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
    401404
    402405# If the value of the INPUT tag contains directories, you can use the
  • src/work/marci/bfs_dfs.h

    r602 r604  
    22#ifndef HUGO_BFS_DFS_H
    33#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
    412
    513#include <queue>
     
    3846      graph(&_graph), reached(*(new ReachedMap(*graph /*, false*/))),
    3947      own_reached_map(true) { }
    40     /// The storing the reached nodes have to be destroyed if
     48    /// The map storing the reached nodes have to be destroyed if
    4149    /// it was constructed dynamically
    4250    ~BfsIterator() { if (own_reached_map) delete &reached; }
     
    162170    /// Beside the bfs iteration, \c pred and \dist are saved in a
    163171    /// newly reached node.
    164     Bfs<Graph, ReachedMap, PredMap, DistMap> operator++() {
     172    Bfs<Graph, ReachedMap, PredMap, DistMap>& operator++() {
    165173      Parent::operator++();
    166174      if (this->graph->valid(this->actual_edge) && this->b_node_newly_reached)
     
    297305    /// Beside the dfs iteration, \c pred is saved in a
    298306    /// newly reached node.
    299     Dfs<Graph, ReachedMap, PredMap> operator++() {
     307    Dfs<Graph, ReachedMap, PredMap>& operator++() {
    300308      Parent::operator++();
    301309      if (this->graph->valid(this->actual_edge) && this->b_node_newly_reached)
  • src/work/marci/bfs_dfs_misc.h

    r602 r604  
    22#ifndef HUGO_BFS_DFS_MISC_H
    33#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
    412
    513#include <bfs_dfs.h>
Note: See TracChangeset for help on using the changeset viewer.