Polish

README.md

@@ -32,8 +32,8 @@ The software has three parts, with separate executable files:
   contours found in the previous part and looks for overlapping
   between these contours at successive dates. The result is an
   abstract graph where each node of the graph corresponds to an
-  instantaneous eddy and nodes are connected by an edge if they
-  overlap. This part is in directory `Overlap`.
+  instantaneous eddy and nodes are connected by an edge if the
+  instantaneous eddies overlap. This part is in directory `Overlap`.
 
 - Identifying trajectories. This part reads the abstract graph
   produced in the previous part and produces paths in this abstract