Changeset 1080:c5cd8960df74 in lemon-main for lemon/min_cost_arborescence.h

Timestamp:

08/06/13 05:38:49 (11 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Message:

Use m instead of e for denoting the number of arcs/edges (#463)

File:

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

lemon/min_cost_arborescence.h

@@ -102 +102 @@
   /// the minimum cost subgraph that is the 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<sup>2</sup>+e).
+  /// sources. The time complexity of the algorithm is O(n<sup>2</sup>+m).
   ///
   /// The algorithm also provides an optimal dual solution, therefore