X-Git-Url: https://mattmccutchen.net/match/match.git/blobdiff_plain/5a07db44406bad03321a90b0814cc4496c6b7d63..00f7bf547ecc8b9a709c6fbeff55b9b0d05ecffe:/program/ProposalMatcher.hs

diff --git a/program/ProposalMatcher.hs b/program/ProposalMatcher.hs
index f523c27..46a693c 100644
--- a/program/ProposalMatcher.hs
+++ b/program/ProposalMatcher.hs
@@ -102,16 +102,6 @@ todo = undefined
 -- Returns a list of reviews as ordered pairs (reviewer#, proposal#).
 doMatching :: Instance -> [(Int, Int)]
 doMatching inst@(Instance numRvrs numProps _ _) =
-	-- Copied from doReduction.  There should be a better way to get these here.
-	let
-		source = 0
-		sink = 1
-		rvrNode i boringness = 2 + 3*i + boringness
-		propNode j expertness = 2 + 3*numRvrs + 3*j + expertness
-		firstPropNode = propNode 0 0
-		idPropNode n = (n - (2 + 3*numRvrs)) `div` 3
-		numNodes = 2 + 3*numRvrs + 3*numProps
-		in
 	let ReductionResult graph source sink idxBounds edIdx = doReduction inst in
 	let flowArray = minCostFlow idxBounds reIdx reCap reCost graph (source, sink) in
 	let pairs = do