COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
04/26/04 20:08:46 (16 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@570
Message:

Many new modules (groups) in the documentation.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/athos/minlengthpaths.h

    r330 r430  
    33#define HUGO_MINLENGTHPATHS_H
    44
     5///ingroup galgs
    56///\file
    67///\brief An algorithm for finding k paths of minimal total length.
     
    1516namespace hugo {
    1617
    17 
     18/// \addtogroup galgs
     19/// @{
    1820
    1921  ///\brief Implementation of an algorithm for finding k paths between 2 nodes
     
    161163  }; //class MinLengthPaths
    162164
     165  ///@}
    163166
    164167} //namespace hugo
Note: See TracChangeset for help on using the changeset viewer.