5 import ProposalMatchConfig
7 import Data.Graph.Inductive.Graph
8 import Data.Graph.Inductive.Tree
10 -- So we can call graphviz' at the GHCi prompt
11 import Data.Graph.Inductive.Graphviz
12 graphviz' g = Data.Graph.Inductive.Graphviz.graphviz' g
14 myGraph = mkGraph [(0, ()), (1, ()), (2, ())]
15 [(0, 1, 2), (0, 2, 3), (2, 1, -2)] :: Gr () Double
17 spTree1 = spTree 0 myGraph
19 (flowVal, flowResid) = umcf 0 1 myGraph
21 -- Example from idea book p. 425
23 (myNumRvrs, myNumProps) = (4, 3)
25 myPrefsArray = array ((0,0), (myNumRvrs-1,myNumProps-1)) [
26 ((0, 0), 15), ((1, 0), 10), ((2, 0), 15), ((3, 0), 40),
27 ((0, 1), 30), ((1, 1), 7), ((2, 1), 10), ((3, 1), 15),
28 ((0, 2), 15), ((1, 2), 25), ((2, 2), 20), ((3, 2), 20)
32 (myNumRvrs, myNumProps) = (5, 3)
34 myPrefsArray = array ((0,0), (myNumRvrs-1,myNumProps-1)) [
35 ((0, 0), 15), ((1, 0), 10), ((2, 0), 15), ((3, 0), 40), ((4, 0), 20),
36 ((0, 1), 30), ((1, 1), 7), ((2, 1), 10), ((3, 1), 15), ((4, 1), 15),
37 ((0, 2), 15), ((1, 2), 25), ((2, 2), 20), ((3, 2), 20), ((4, 2), 15)
40 myPrefs = \i j -> myPrefsArray ! (i, j)
41 myInst = Instance myNumRvrs myNumProps (const 1) myPrefs
43 rdnGraph = doReduction myInst
44 (rdnFlowVal, rdnFlowResid) = umcf 0 1 rdnGraph
45 rdnFlow = flowDiff rdnGraph rdnFlowResid
46 myMatching = doMatching myInst