COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
04/07/06 11:54:35 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2681
Message:

New Algorithm group for matchings

LaTeX formulas
Bug fix => /\f$ will cause parsing error in doxygen

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/min_cost_arborescence.h

    r2037 r2042  
    9898  /// the minimum cost subgraph which are union of arborescences with the
    9999  /// given sources and spans all the nodes which are reachable from the
    100   /// sources. The time complexity of the algorithm is O(n^2 + e).
     100  /// sources. The time complexity of the algorithm is \f$ O(n^2+e) \f$.
    101101  ///
    102102  /// The algorithm provides also an optimal dual solution to arborescence
    103   /// that way the optimality of the algorithm can be proofed easily.
     103  /// that way the optimality of the solution can be proofed easily.
    104104  ///
    105105  /// \param _Graph The graph type the algorithm runs on. The default value
Note: See TracChangeset for help on using the changeset viewer.