p asn 10 13
c Assignment flow problem
c Max arc cost 1000000000
c nodes 5
c sources 1
n 1
n 2
n 3
n 4
n 5
a 1 6 5
a 1 7 6
a 1 8 7
a 1 9 8
a 1 10 1000000000
a 2 10 5
a 2 6 1000000000
a 3 10 6
a 3 7 1000000000
a 4 10 7
a 4 8 1000000000
a 5 10 8
a 5 9 1000000000

p asn 10 13
c Assignment flow problem
c Max arc cost 1000000000
c nodes 5
c sources 1
n 1
n 2
n 3
n 4
n 5
a 1 6 5
a 1 7 6
a 1 8 7
a 1 9 8
a 1 10 -1000000000
a 2 10 5
a 2 6 -1000000000
a 3 10 6
a 3 7 -1000000000
a 4 10 7
a 4 8 -1000000000
a 5 10 8
a 5 9 -1000000000

Switch 5-node graph fixture to minimum matching
Switch 5-node graph fixture to minimum matching

As that's basically what the version we're running does. #yolo
