COIN-OR::LEMON - Graph Library

Changeset 615:b6b31b75b522 in lemon-0.x for src/work/marci/bfs_dfs_misc.h


Ignore:
Timestamp:
05/11/04 21:50:21 (17 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@800
Message:

docs, max_flow improvments

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/marci/bfs_dfs_misc.h

    r604 r615  
    33#define HUGO_BFS_DFS_MISC_H
    44
    5 // ///\ingroup gwrappers
    6 ///\file
    7 ///\brief Miscellaneous algorithms using bfs and dfs.
     5/// \ingroup galgs
     6/// \file
     7/// \brief Miscellaneous algorithms using bfs and dfs.
    88///
    9 ///This file contains several algorithms using bfs and dfs.
     9/// This file contains several algorithms using bfs and dfs.
    1010///
    1111// ///\author Marton Makai
     
    1616namespace hugo {
    1717
    18   /// This function eat a read-write \c BoolMap& bool_map,
     18  /// This function eats a read-write \c BoolMap& bool_map,
    1919  /// which have to work well up
    2020  /// to its \c set and \c operator[]() method. Thus we have to deal
    2121  /// very carefully with an uninitialized \c IterableBoolMap.
     22  /// \ingroup galgs
    2223  template<typename Graph, typename BoolMap>
    2324  bool isBipartite(const Graph& g, BoolMap& bool_map) {
     
    5354  /// then going back from the returned node via the pred information, a
    5455  /// cycle is obtained.
     56  /// \ingroup galgs
    5557  template<typename Graph, typename PredMap>
    5658  typename Graph::Node
     
    9092    return INVALID;
    9193  }
     94
    9295} //namespace hugo
    9396
Note: See TracChangeset for help on using the changeset viewer.