COIN-OR::LEMON - Graph Library

Changeset 2376:0ed45a6c74b1 in lemon-0.x for lemon/nagamochi_ibaraki.h


Ignore:
Timestamp:
02/21/07 14:30:21 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3195
Message:

Reorganization of the modules and groups

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/nagamochi_ibaraki.h

    r2337 r2376  
    1919
    2020
    21 /// \ingroup topology
     21/// \ingroup min_cut
    2222/// \file
    2323/// \brief Maximum cardinality search and minimum cut in undirected
     
    157157  };
    158158 
    159   /// \ingroup topology
     159  /// \ingroup search
    160160  ///
    161161  /// \brief Maximum Cardinality Search algorithm class.
     
    833833  };
    834834
    835   /// \ingroup topology
     835  /// \ingroup min_cut
    836836  ///
    837837  /// \brief Calculates the minimum cut in an undirected graph.
Note: See TracChangeset for help on using the changeset viewer.