COIN-OR::LEMON - Graph Library

Changeset 2084:59769591eb60 in lemon-0.x for lemon/kruskal.h


Ignore:
Timestamp:
05/15/06 11:49:51 (14 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2749
Message:

Documentation improvements

Rearrangements:

IO modules
Algorithms

New documentation:

SwapBpUGraphAdaptor

Demos:

strongly_connected_orientation.cc

Benchmarks:

swap_bipartite_bench.cc

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/kruskal.h

    r1993 r2084  
    2525#include <lemon/bits/utility.h>
    2626#include <lemon/bits/traits.h>
    27 
    28 /**
    29 @defgroup spantree Minimum Cost Spanning Tree Algorithms
    30 @ingroup galgs
    31 \brief This group containes the algorithms for finding a minimum cost spanning
    32 tree in a graph
    33 
    34 This group containes the algorithms for finding a minimum cost spanning
    35 tree in a graph
    36 */
    3727
    3828///\ingroup spantree
Note: See TracChangeset for help on using the changeset viewer.