Corrected some obvious errors.
2 //#include "test_tools.h"
3 #include <hugo/list_graph.h>
4 #include <mincostflow.h>
15 void check(bool rc, char *msg="") {
16 passed = passed && rc;
18 std::cerr << "Test failed! ("<< msg << ")" << std::endl; \
29 typedef ListGraph::Node Node;
30 typedef ListGraph::Edge Edge;
36 Node s=graph.addNode();
37 Node v1=graph.addNode();
38 Node v2=graph.addNode();
39 Node v3=graph.addNode();
40 Node v4=graph.addNode();
41 Node v5=graph.addNode();
42 Node t=graph.addNode();
44 Edge s_v1=graph.addEdge(s, v1);
45 Edge v1_v2=graph.addEdge(v1, v2);
46 Edge s_v3=graph.addEdge(s, v3);
47 Edge v2_v4=graph.addEdge(v2, v4);
48 Edge v2_v5=graph.addEdge(v2, v5);
49 Edge v3_v5=graph.addEdge(v3, v5);
50 Edge v4_t=graph.addEdge(v4, t);
51 Edge v5_t=graph.addEdge(v5, t);
54 ListGraph::EdgeMap<int> cost(graph);
66 ListGraph::EdgeMap<int> capacity(graph);
68 capacity.set(s_v1, 2);
69 capacity.set(v1_v2, 2);
70 capacity.set(s_v3, 1);
71 capacity.set(v2_v4, 1);
72 capacity.set(v2_v5, 1);
73 capacity.set(v3_v5, 1);
74 capacity.set(v4_t, 1);
75 capacity.set(v5_t, 2);
78 // ConstMap<Edge, int> const1map(1);
79 std::cout << "Enhanced capacity scaling algorithm test (for the mincostflow problem)..." << std::endl;
81 MinCostFlow< ListGraph, ListGraph::EdgeMap<int>, ListGraph::NodeMap<int> >
82 min_cost_flow_test(graph, cost, supply_demand);
87 check( min_cost_flow_test.run(s,t,k) == 1 && min_cost_flow_test.totalLength() == 19,"One path, total cost should be 19");
89 check(min_cost_flow_test.checkComplementarySlackness(), "Is the primal-dual solution pair really optimal?");
93 check( min_cost_flow_test.run(s,t,k) == 2 && min_cost_flow_test.totalLength() == 41,"Two paths, total cost should be 41");
95 check(min_cost_flow_test.checkComplementarySlackness(), "Is the primal-dual solution pair really optimal?");
100 check( min_cost_flow_test.run(s,t,k) == 3 && min_cost_flow_test.totalLength() == 64,"Three paths, total cost should be 64");
102 check(min_cost_flow_test.checkComplementarySlackness(), "Is the primal-dual solution pair really optimal?");
105 cout << (passed ? "All tests passed." : "Some of the tests failed!!!")
108 return passed ? 0 : 1;