COIN-OR::LEMON - Graph Library

Changeset 758:49b1a30c4dc4 in lemon-0.x for src/work


Ignore:
Timestamp:
08/05/04 13:38:26 (17 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.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • 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.