Changeset 2509:a8081c9cd96a in lemon-0.x for lemon/min_mean_cycle.h

Timestamp:

11/14/07 07:28:08 (16 years ago)

Author:

Peter Kovacs

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3374

Message:

Small changes in the min. cost flow classes.

File:

• lemon/min_mean_cycle.h (modified) (3 diffs)

lemon/min_mean_cycle.h

@@ -23 +23 @@
 ///
 /// \file
-/// \brief Karp algorithm for finding a minimum mean cycle.
-
+/// \brief Karp's algorithm for finding a minimum mean (directed) cycle.
+
+#include <vector>
 #include <lemon/graph_utils.h>
 #include <lemon/topology.h>
@@ -64 +65 @@
   protected:
 
-    /// \brief Data sturcture for path data.
+    /// \brief Data structure for path data.
     struct PathData
     {
@@ -151 +152 @@
       // Creating vectors for all nodes
       int n = nodes.size();
-      for (int i = 0; i < nodes.size(); ++i) {
+      for (int i = 0; i < n; ++i) {
         dmap[nodes[i]].resize(n + 1);
       }