5 import ProposalMatchConfig
7 import Data.Graph.Inductive.Graph
8 import Data.Graph.Inductive.Tree
10 myGraph = mkGraph [(0, ()), (1, ()), (2, ())]
11 [(0, 1, 2), (0, 2, 3), (2, 1, -2)] :: Gr () Double
13 spTree1 = spTree 0 myGraph
15 (flowVal, flowResid) = umcf 0 1 myGraph
17 -- Example from idea book p. 425
19 (myNumRvrs, myNumProps) = (4, 3)
21 myPrefsArray = array ((0,0), (myNumRvrs-1,myNumProps-1)) [
22 ((0, 0), 15), ((1, 0), 10), ((2, 0), 15), ((3, 0), 40),
23 ((0, 1), 30), ((1, 1), 7), ((2, 1), 10), ((3, 1), 15),
24 ((0, 2), 15), ((1, 2), 25), ((2, 2), 20), ((3, 2), 20)
28 (myNumRvrs, myNumProps) = (5, 3)
30 myPrefsArray = array ((0,0), (myNumRvrs-1,myNumProps-1)) [
31 ((0, 0), 15), ((1, 0), 10), ((2, 0), 15), ((3, 0), 40), ((4, 0), 20),
32 ((0, 1), 30), ((1, 1), 7), ((2, 1), 10), ((3, 1), 15), ((4, 1), 15),
33 ((0, 2), 15), ((1, 2), 25), ((2, 2), 20), ((3, 2), 20), ((4, 2), 15)
36 myPrefs = \i j -> myPrefsArray ! (i, j)
37 myInst = Instance myNumRvrs myNumProps myPrefs
39 --rdnGraph = doReduction myInst (const (fromInteger wantExpertReviews))
40 --(rdnFlowVal, rdnFlowResid) = umcf 0 1 rdnGraph
41 --rdnFlow = flowDiff rdnGraph rdnFlowResid
42 myMatching = doMatching myInst