diff -r c86db0f7f917 -r a8081c9cd96a lemon/min_mean_cycle.h
--- a/lemon/min_mean_cycle.h	Thu Nov 08 14:21:28 2007 +0000
+++ b/lemon/min_mean_cycle.h	Wed Nov 14 06:28:08 2007 +0000
@@ -22,8 +22,9 @@
 /// \ingroup min_cost_flow
 ///
 /// \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>
 #include <lemon/path.h>
@@ -63,7 +64,7 @@
 
   protected:
 
-    /// \brief Data sturcture for path data.
+    /// \brief Data structure for path data.
     struct PathData
     {
       bool found;
@@ -150,7 +151,7 @@
       }
       // 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);
       }
     }