fix typo

readme.md

@@ -281,7 +281,7 @@ with different filtering options), the actual elapsed time was greater. File I/O
 slightly less time than the simulation itself. Real elapsed time from start to finish was under 30 minutes.
 
 As mentioned in the theory section, performance could be improved by implementing a more efficient algorithm for finding
-the maximum weighted matching.
+the maximum weight matching.
 
 ## BEHAVIOR WITH RANDOMIZED WELL POPULATIONS
 

src/main/java/Simulator.java

@@ -179,9 +179,9 @@ public class Simulator implements GraphModificationFunctions {
         if(verbose){System.out.println("Edges between vertices of with excessively different occupancy values " +
                 "removed");}
 
-        //Find Maximum Weighted Matching
+        //Find Maximum Weight Matching
         //using jheaps library class PairingHeap for improved efficiency
-        if(verbose){System.out.println("Finding maximum weighted matching");}
+        if(verbose){System.out.println("Finding maximum weight matching");}
         MaximumWeightBipartiteMatching maxWeightMatching;
         //Use correct heap type for priority queue
         String heapType = BiGpairSEQ.getPriorityQueueHeapType();