1.1 --- a/lemon/network_simplex.h	Fri Mar 15 17:19:17 2013 +0100
     1.2 +++ b/lemon/network_simplex.h	Sat Mar 16 13:14:35 2013 +0100
     1.3 @@ -1503,7 +1503,7 @@
     1.4              }
     1.5            }
     1.6          } else {
     1.7 -          // Find the min. cost incomming arc for each demand node
     1.8 +          // Find the min. cost incoming arc for each demand node
     1.9            for (int i = 0; i != int(demand_nodes.size()); ++i) {
    1.10              Node v = demand_nodes[i];
    1.11              Cost c, min_cost = std::numeric_limits<Cost>::max();