COIN-OR::LEMON - Graph Library

Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/matching.h

    r594 r651  
    500500    /// This function runs the original Edmonds' algorithm.
    501501    ///
    502     /// \pre \ref Init(), \ref greedyInit() or \ref matchingInit() must be
     502    /// \pre \ref init(), \ref greedyInit() or \ref matchingInit() must be
    503503    /// called before using this function.
    504504    void startSparse() {
     
    519519    /// shrinks, therefore resulting in a faster algorithm for dense graphs.
    520520    ///
    521     /// \pre \ref Init(), \ref greedyInit() or \ref matchingInit() must be
     521    /// \pre \ref init(), \ref greedyInit() or \ref matchingInit() must be
    522522    /// called before using this function.
    523523    void startDense() {
Note: See TracChangeset for help on using the changeset viewer.