Changeset 2042:bdc953f2a449 in lemon-0.x for lemon/min_cost_arborescence.h

Timestamp:

04/07/06 11:54:35 (18 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:

• lemon/min_cost_arborescence.h (modified) (1 diff)

lemon/min_cost_arborescence.h

@@ -98 +98 @@
   /// the minimum cost subgraph which are union of arborescences with the
   /// given sources and spans all the nodes which are reachable from the
-  /// sources. The time complexity of the algorithm is O(n^2 + e).
+  /// sources. The time complexity of the algorithm is \f$ O(n^2+e) \f$.
   ///
   /// The algorithm provides also an optimal dual solution to arborescence
-  /// that way the optimality of the algorithm can be proofed easily.
+  /// that way the optimality of the solution can be proofed easily.
   ///
   /// \param _Graph The graph type the algorithm runs on. The default value