forked from cp-algorithms/cp-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_pruefer_code.cpp
More file actions
62 lines (56 loc) · 1.35 KB
/
test_pruefer_code.cpp
File metadata and controls
62 lines (56 loc) · 1.35 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include <cassert>
#include <vector>
#include <set>
using namespace std;
namespace SLOW {
#include "pruefer_code_slow.h"
#include "pruefer_decode_slow.h"
}
namespace FAST {
#include "pruefer_code_fast.h"
#include "pruefer_decode_fast.h"
}
vector<vector<int>> get_adj(vector<pair<int, int>> edges) {
vector<vector<int>> adj(edges.size() + 1);
for (auto edge : edges) {
adj[edge.first].push_back(edge.second);
adj[edge.second].push_back(edge.first);
}
return adj;
}
int main() {
{
using namespace SLOW;
adj = {
{3},
{3},
{3},
{0, 1, 2, 4},
{3, 5},
{4}
};
vector<int> exp_code = {3, 3, 3, 4};
assert(pruefer_code() == exp_code);
vector<int> code2 = {5, 3, 2, 4, 4};
auto edges = pruefer_decode(code2);
adj = get_adj(edges);
assert(pruefer_code() == code2);
}
{
using namespace FAST;
adj = {
{3},
{3},
{3},
{0, 1, 2, 4},
{3, 5},
{4}
};
vector<int> exp_code = {3, 3, 3, 4};
assert(pruefer_code() == exp_code);
vector<int> code2 = {5, 3, 2, 4, 4};
auto edges = pruefer_decode(code2);
adj = get_adj(edges);
assert(pruefer_code() == code2);
}
}