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

Function test

code/graph/kruskals_mst.test.cpp:1–21  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1void test() {
2 vector<pair<int, ii> > edges;
3
4 edges.push_back(pair<int, ii>(4, ii(0, 1)));
5 edges.push_back(pair<int, ii>(9, ii(0, 2)));
6 edges.push_back(pair<int, ii>(21, ii(0, 3)));
7 edges.push_back(pair<int, ii>(4, ii(1, 0)));
8 edges.push_back(pair<int, ii>(8, ii(1, 2)));
9 edges.push_back(pair<int, ii>(17, ii(1, 3)));
10 edges.push_back(pair<int, ii>(9, ii(2, 0)));
11 edges.push_back(pair<int, ii>(8, ii(2, 1)));
12 edges.push_back(pair<int, ii>(16, ii(2, 3)));
13 edges.push_back(pair<int, ii>(21, ii(3, 0)));
14 edges.push_back(pair<int, ii>(17, ii(3, 1)));
15 edges.push_back(pair<int, ii>(16, ii(3, 2)));
16
17 vector<pair<int, ii> > res = mst(4, edges);
18 int sum = 0;
19 for (int i = 0; i < size(res); i++) sum += res[i].first;
20 assert_equal(28, sum);
21}
22// vim: cc=60 ts=2 sts=2 sw=2:

Callers

nothing calls this directly

Calls 3

mstFunction · 0.85
push_backMethod · 0.80
assert_equalFunction · 0.50

Tested by

no test coverage detected