-
Notifications
You must be signed in to change notification settings - Fork 0
/
TreeNode.cpp
51 lines (38 loc) · 1007 Bytes
/
TreeNode.cpp
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
#include "TreeNode.h"
TreeNode::TreeNode()
{
}
TreeNode::~TreeNode()
{
for (TreeNode* node : _childs)
delete node;
}
Turns TreeNode::GenerateTurns()
{
Turns turns;
Turn turn;
WalkNodes(this, turn, turns);
size_t longest = 0;
for (Turn turn : turns)
if (turn.size() > longest)
longest = turn.size();
Turns filteredTurns;
for (Turn turn : turns)
if (turn.size() == longest)
filteredTurns.push_back(turn);
return filteredTurns;
}
void TreeNode::WalkNodes(TreeNode* node, Turn turn, Turns& turns)
{
for (TreeNode* childNode : node->GetChilds())
{
if (turn.size() == 0)
turn.push_back(node->GetPosition());
else if (!turn.back().CompareTo(node->GetPosition()))
turn.push_back(node->GetPosition());
Turn turnCopy(turn);
turnCopy.push_back(childNode->GetPosition());
turns.push_back(turnCopy);
WalkNodes(childNode, turn, turns);
}
}