- Implement CS2 min-cost-flow adaptor and generalize common min-cost-flow stuff

[match/match.git] / program / Instance.hs

module Instance (module Instance, Wt) where
import ProposalMatcherConfig (Wt)
import Data.Array.IArray
import Data.Array.Unboxed
import ArrayStuff
import Formatter

data Instance = Instance
	Int                 -- numReviewers
	Int                 -- numProposals
	(UArray Int Wt)     -- ! reviewer -> relative load
	(UArray (Int, Int) Wt) -- ! (reviewer, proposal) -> pref
	deriving Eq

instance Show Instance where
	show (Instance numRvrs numProps loadA prefA) =
		let theRvrs = [0..numRvrs-1]; theProps = [0..numProps-1] in
		"Instance with " ++ show numRvrs ++ " reviewers and " ++ show numProps ++ " proposals:\n" ++ formatTable (
			    (       ""              : map (\i -> "R#" ++ show i       ) theRvrs) :
			    (       "RLoad"         : map (\i -> show (loadA ! i)     ) theRvrs) :
			map (\j -> ("P#" ++ show j) : map (\i -> show (prefA ! (i, j))) theRvrs) theProps
		)