COIN-OR::LEMON - Graph Library

Changeset 1053:1c978b5bcc65 in lemon-main for lemon/preflow.h


Ignore:
Timestamp:
03/18/13 17:41:19 (11 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/preflow.h

    r966 r1053  
    103103  /// This class provides an implementation of Goldberg-Tarjan's \e preflow
    104104  /// \e push-relabel algorithm producing a \ref max_flow
    105   /// "flow of maximum value" in a digraph \ref clrs01algorithms,
    106   /// \ref amo93networkflows, \ref goldberg88newapproach.
     105  /// "flow of maximum value" in a digraph \cite clrs01algorithms,
     106  /// \cite amo93networkflows, \cite goldberg88newapproach.
    107107  /// The preflow algorithms are the fastest known maximum
    108108  /// flow algorithms. The current implementation uses a mixture of the
Note: See TracChangeset for help on using the changeset viewer.