MCPcopy Create free account
hub / github.com/SuprDewd/CompetitiveProgramming / test

Function test

code/graph/edmonds_karps.test.cpp:76–120  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

74}
75
76void test() {
77 /* Field testing: UVa259, UVa670, UVa10080, UVa10330, ICPC Live Archive 5905, ICPC Live Archive 3792 */
78 /* Field testing (v2): Kattis maxflow */
79
80 flow_network mf(4);
81 mf.add_edge(0, 1, 133700);
82 mf.add_edge(0, 2, 133700);
83 mf.add_edge(1, 2, 1);
84 mf.add_edge(1, 3, 133700);
85 mf.add_edge(2, 3, 133700);
86 assert_equal(2 * 133700, mf.max_flow(0, 3));
87
88 mf = flow_network(5);
89 mf.add_edge(1, 2, 100);
90 mf.add_edge(1, 3, 50);
91 mf.add_edge(2, 3, 50);
92 mf.add_edge(2, 4, 50);
93 mf.add_edge(2, 0, 50);
94 mf.add_edge(3, 4, 100);
95 mf.add_edge(4, 0, 125);
96 assert_equal(150, mf.max_flow(1, 0));
97
98 mf = flow_network(5);
99 mf.add_edge(1, 2, 100);
100 mf.add_edge(1, 3, 50);
101 mf.add_edge(2, 3, 50);
102 mf.add_edge(2, 4, 50);
103 mf.add_edge(2, 0, 50);
104 mf.add_edge(3, 4, 100);
105 mf.add_edge(4, 0, 75);
106 assert_equal(125, mf.max_flow(1, 0));
107
108 mf = flow_network(5);
109 mf.add_edge(1, 2, 100);
110 mf.add_edge(1, 3, 50);
111 mf.add_edge(2, 4, 5);
112 mf.add_edge(2, 0, 5);
113 mf.add_edge(3, 4, 100);
114 mf.add_edge(4, 0, 125);
115 assert_equal(60, mf.max_flow(1, 0));
116
117 test1();
118 test2();
119 test3();
120}
121// vim: cc=60 ts=2 sts=2 sw=2:

Callers

nothing calls this directly

Calls 7

flow_networkClass · 0.70
test1Function · 0.70
test2Function · 0.70
test3Function · 0.70
assert_equalFunction · 0.50
add_edgeMethod · 0.45
max_flowMethod · 0.45

Tested by

no test coverage detected