From 740835f8142e71380fe87477eed57c0cad597cd6 Mon Sep 17 00:00:00 2001
From: eugenefischer <66030419+eugenefischer@users.noreply.github.com>
Date: Sun, 25 Sep 2022 17:47:07 -0500
Subject: [PATCH] fix typo

---
 readme.md                    | 2 +-
 src/main/java/Simulator.java | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/readme.md b/readme.md
index b6f2251..73ab977 100644
--- a/readme.md
+++ b/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
 
diff --git a/src/main/java/Simulator.java b/src/main/java/Simulator.java
index 28dd8ff..ede14e8 100644
--- a/src/main/java/Simulator.java
+++ b/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();