+module Test where
+import BellmanFord
+import UnitMinCostFlow
+import ProposalMatch
+import ProposalMatchConfig
+import Data.Array
+import Data.Graph.Inductive.Graph
+import Data.Graph.Inductive.Tree
+
+myGraph = mkGraph [(0, ()), (1, ()), (2, ())]
+ [(0, 1, 2), (0, 2, 3), (2, 1, -2)] :: Gr () Double
+
+spTree1 = spTree 0 myGraph
+
+(flowVal, flowResid) = umcf 0 1 myGraph
+
+-- Example from idea book p. 425
+{-
+(myNumRvrs, myNumProps) = (4, 3)
+
+myPrefsArray = array ((0,0), (myNumRvrs-1,myNumProps-1)) [
+ ((0, 0), 15), ((1, 0), 10), ((2, 0), 15), ((3, 0), 40),
+ ((0, 1), 30), ((1, 1), 7), ((2, 1), 10), ((3, 1), 15),
+ ((0, 2), 15), ((1, 2), 25), ((2, 2), 20), ((3, 2), 20)
+ ]
+-}
+
+(myNumRvrs, myNumProps) = (5, 3)
+
+myPrefsArray = array ((0,0), (myNumRvrs-1,myNumProps-1)) [
+ ((0, 0), 15), ((1, 0), 10), ((2, 0), 15), ((3, 0), 40), ((4, 0), 20),
+ ((0, 1), 30), ((1, 1), 7), ((2, 1), 10), ((3, 1), 15), ((4, 1), 15),
+ ((0, 2), 15), ((1, 2), 25), ((2, 2), 20), ((3, 2), 20), ((4, 2), 15)
+ ]
+
+myPrefs = \i j -> myPrefsArray ! (i, j)
+myInst = Instance myNumRvrs myNumProps myPrefs
+
+--rdnGraph = doReduction myInst (const (fromInteger wantExpertReviews))
+--(rdnFlowVal, rdnFlowResid) = umcf 0 1 rdnGraph
+--rdnFlow = flowDiff rdnGraph rdnFlowResid
+myMatching = doMatching myInst