COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
03/18/13 17:41:19 (7 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Phase:
public
Message:

Use doxygen's own bibtex support (#456)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/hartmann_orlin_mmc.h

    r1217 r1221  
    9999  /// This class implements the Hartmann-Orlin algorithm for finding
    100100  /// a directed cycle of minimum mean cost in a digraph
    101   /// \ref hartmann93finding, \ref dasdan98minmeancycle.
     101  /// \cite hartmann93finding, \cite dasdan98minmeancycle.
    102102  /// This method is based on \ref KarpMmc "Karp"'s original algorithm, but
    103103  /// applies an early termination scheme. It makes the algorithm
Note: See TracChangeset for help on using the changeset viewer.