-
Notifications
You must be signed in to change notification settings - Fork 1
/
Rooted Tree.h
62 lines (49 loc) · 1.35 KB
/
Rooted Tree.h
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
template<typename T>
class RootedTree
{
public:
class Node
{
public:
Node() : data(), parent(), children()
{}
void build(Node *root)
{
this->parent = root;
children.resize(remove(children.begin(), children.end(), root) - children.begin());
for (unsigned i = 0; i < children.size(); i++)
children[i]->build(this);
}
T data;
Node *parent;
std::vector<Node *> children;
};
RootedTree(std::vector<T> vertex, std::vector<std::pair<int, int>> edge, int root) :
nodes(vertex.size()), root()
{
for (unsigned i = 0; i < vertex.size(); i++)
nodes[i].data = vertex[i];
for (unsigned i = 0; i < edge.size(); i++)
{
this->nodes[edge[i].first].children.push_back(&this->nodes[edge[i].second]);
this->nodes[edge[i].second].children.push_back(&this->nodes[edge[i].first]);
}
this->nodes[root].build(nullptr);
this->root = &nodes[root];
}
std::vector<Node> nodes;
Node *root;
};
class Tree
{
public:
Tree(unsigned n) : n(n), adj(n)
{}
void addDirected(int u, int v)
{ adj[u].push_back(v); }
void addUndirected(int u, int v)
{ addDirected(u, v); addDirected(v, u); }
protected:
int n;
vector<vector<int>> adj;
};