COIN-OR::LEMON - Graph Library

Changeset 758:49b1a30c4dc4 in lemon-0.x


Ignore:
Timestamp:
08/05/04 13:38:26 (15 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1018
Message:

New Doxygen module for path/flow algs.

Files:
5 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r678 r758  
    4646
    4747/**
    48 @defgroup spantree Minimum Cost Spanning Tree Algorithms
    49 \brief This group containes the algorithms for finding a minimum cost spanning
    50 tree in a graph
     48@defgroup flowalgs Path and Flow Algorithms
    5149@ingroup galgs
     50\brief This group describes the algorithms
     51for finding paths and flows in graphs.
    5252*/
    5353
  • src/hugo/dijkstra.h

    r734 r758  
    33#define HUGO_DIJKSTRA_H
    44
    5 ///\ingroup galgs
     5///\ingroup flowalgs
    66///\file
    77///\brief Dijkstra algorithm.
     
    1212namespace hugo {
    1313
    14 /// \addtogroup galgs
     14/// \addtogroup flowalgs
    1515/// @{
    1616
  • src/hugo/max_flow.h

    r757 r758  
    1111
    1212/// \file
    13 /// \ingroup galgs
     13/// \ingroup flowalgs
    1414
    1515namespace hugo {
    1616
    17   /// \addtogroup galgs
    18   /// @{                                                                                                                                       
     17  /// \addtogroup flowalgs
     18  /// @{                                                   
     19
    1920  ///Maximum flow algorithms class.
    2021
     
    2728  ///\ref setFlow. Before any subsequent runs of any algorithm of
    2829  ///the class \ref setFlow should be called.
    29 
     30  ///
    3031  ///After running an algorithm of the class, the actual flow value
    3132  ///can be obtained by calling \ref flowValue(). The minimum
     
    3334  ///calling \ref minCut. (\ref minMinCut and \ref maxMinCut writes
    3435  ///the inclusionwise minimum and maximum of the minimum value
    35   ///cuts, resp.)                                                                                                                               
     36  ///cuts, resp.)
     37  ///
    3638  ///\param Graph The directed graph type the algorithm runs on.
    3739  ///\param Num The number type of the capacities and the flow values.
    3840  ///\param CapMap The capacity map type.
    39   ///\param FlowMap The flow map type.                                                                                                           
     41  ///\param FlowMap The flow map type.
     42  ///
    4043  ///\author Marton Makai, Jacint Szabo
    4144  template <typename Graph, typename Num,
  • src/hugo/mincostflows.h

    r661 r758  
    33#define HUGO_MINCOSTFLOWS_H
    44
    5 ///\ingroup galgs
     5///\ingroup flowalgs
    66///\file
    77///\brief An algorithm for finding a flow of value \c k (for small values of \c k) having minimal total cost
     
    1616namespace hugo {
    1717
    18 /// \addtogroup galgs
     18/// \addtogroup flowalgs
    1919/// @{
    2020
  • src/work/johanna/kruskal.h

    r755 r758  
    66#include <hugo/unionfind.h>
    77
     8/**
     9@defgroup spantree Minimum Cost Spanning Tree Algorithms
     10\brief This group containes the algorithms for finding a minimum cost spanning
     11tree in a graph
     12@ingroup galgs
     13*/
     14
     15///\ingroup spantree
    816///\file
    917///\brief Kruskal's algorithm to compute a minimum cost tree
    1018
    1119namespace hugo {
     20
     21  /// \addtogroup spantree
     22  /// @{
    1223
    1324  /// Kruskal's algorithm to find a minimum cost tree of a graph.
     
    294305  }
    295306
     307  /// @}
    296308
    297309} //namespace hugo
Note: See TracChangeset for help on using the changeset viewer.