From 910de0ce9db0324b8c1b07ba6b5094642d654362 Mon Sep 17 00:00:00 2001
From: eugenefischer <66030419+eugenefischer@users.noreply.github.com>
Date: Fri, 21 Oct 2022 13:46:10 -0500
Subject: [PATCH] Fix typos

---
 .../java/MaximumWeightBipartiteAuctionMatching.java | 13 +++++++++++--
 1 file changed, 11 insertions(+), 2 deletions(-)

diff --git a/src/main/java/MaximumWeightBipartiteAuctionMatching.java b/src/main/java/MaximumWeightBipartiteAuctionMatching.java
index 9f21515..b9ba8aa 100644
--- a/src/main/java/MaximumWeightBipartiteAuctionMatching.java
+++ b/src/main/java/MaximumWeightBipartiteAuctionMatching.java
@@ -7,7 +7,7 @@ import java.util.*;
 
 /*
 Maximum weight matching in bipartite graphs with strictly integer edge weights, found using the
-
+unscaled forward auction algorithm
  */
 
 public class MaximumWeightBipartiteAuctionMatching<V, E> implements MatchingAlgorithm<V, E> {
@@ -49,7 +49,7 @@ public class MaximumWeightBipartiteAuctionMatching<V, E> implements MatchingAlgo
         }
 
         /*
-        If the two partitions are different sizes, the bidders mus be the smaller of the two paritions.
+        If the two partitions are different sizes, the bidders must be the smaller of the two partitions.
          */
         Set<V> items;
         Set<V> bidders;
@@ -130,6 +130,15 @@ public class MaximumWeightBipartiteAuctionMatching<V, E> implements MatchingAlgo
         }
     }
 
+    private V getBidder(V item, E edge) {
+        if (swappedPartitions) {
+            return graph.getEdgeTarget(edge);
+        }
+        else {
+            return graph.getEdgeSource(edge);
+        }
+    }
+
     public BigDecimal getMatchingWeight() {
         return matchingWeight;
     }