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