Changeset 2509:a8081c9cd96a in lemon0.x for lemon/min_mean_cycle.h
 Timestamp:
 11/14/07 07:28:08 (17 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3374
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/min_mean_cycle.h
r2437 r2509 23 23 /// 24 24 /// \file 25 /// \brief Karp algorithm for finding a minimum mean cycle. 26 25 /// \brief Karp's algorithm for finding a minimum mean (directed) cycle. 26 27 #include <vector> 27 28 #include <lemon/graph_utils.h> 28 29 #include <lemon/topology.h> … … 64 65 protected: 65 66 66 /// \brief Data st urcture for path data.67 /// \brief Data structure for path data. 67 68 struct PathData 68 69 { … … 151 152 // Creating vectors for all nodes 152 153 int n = nodes.size(); 153 for (int i = 0; i < n odes.size(); ++i) {154 for (int i = 0; i < n; ++i) { 154 155 dmap[nodes[i]].resize(n + 1); 155 156 }
Note: See TracChangeset
for help on using the changeset viewer.