1.1 --- a/lemon/min_mean_cycle.h	Thu Nov 08 14:21:28 2007 +0000
     1.2 +++ b/lemon/min_mean_cycle.h	Wed Nov 14 06:28:08 2007 +0000
     1.3 @@ -22,8 +22,9 @@
     1.4  /// \ingroup min_cost_flow
     1.5  ///
     1.6  /// \file
     1.7 -/// \brief Karp algorithm for finding a minimum mean cycle.
     1.8 +/// \brief Karp's algorithm for finding a minimum mean (directed) cycle.
     1.9  
    1.10 +#include <vector>
    1.11  #include <lemon/graph_utils.h>
    1.12  #include <lemon/topology.h>
    1.13  #include <lemon/path.h>
    1.14 @@ -63,7 +64,7 @@
    1.15  
    1.16    protected:
    1.17  
    1.18 -    /// \brief Data sturcture for path data.
    1.19 +    /// \brief Data structure for path data.
    1.20      struct PathData
    1.21      {
    1.22        bool found;
    1.23 @@ -150,7 +151,7 @@
    1.24        }
    1.25        // Creating vectors for all nodes
    1.26        int n = nodes.size();
    1.27 -      for (int i = 0; i < nodes.size(); ++i) {
    1.28 +      for (int i = 0; i < n; ++i) {
    1.29  	dmap[nodes[i]].resize(n + 1);
    1.30        }
    1.31      }