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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
use std::collections::VecDeque;
pub struct Node<T> {
data: T,
children: Vec<Node<T>>,
}
impl<T> Node<T> {
pub fn new(data: T) -> Self {
Node {
data,
children: Vec::new(),
}
}
pub fn add(&mut self, node: Node<T>) {
self.children.push(node);
}
pub fn data_mut(&mut self) -> &mut T {
&mut self.data
}
pub fn data(&self) -> &T {
&self.data
}
pub fn child(&self, index: usize) -> Option<&Node<T>> {
self.children.get(index)
}
pub fn last_child(&self) -> Option<&Node<T>> {
self.children.last()
}
pub fn child_mut(&mut self, index: usize) -> Option<&mut Node<T>> {
self.children.get_mut(index)
}
pub fn last_child_mut(&mut self) -> Option<&mut Node<T>> {
self.children.last_mut()
}
pub fn children(&self) -> &Vec<Node<T>> {
&self.children
}
pub fn children_mut(&mut self) -> &mut Vec<Node<T>> {
&mut self.children
}
pub fn child_by_path(&self, path: &Vec<usize>) -> Option<&Node<T>> {
let mut node: Option<&Node<T>> = Some(self);
let level = path.len();
for i in 1..level {
if node.is_some() {
node = node.unwrap().child(*path.get(i).unwrap());
}
}
return node;
}
pub fn child_mut_by_path(&mut self, path: &Vec<usize>) -> Option<&mut Node<T>> {
let mut node: Option<&mut Node<T>> = Some(self);
let level = path.len();
for i in 1..level {
if node.is_some() {
node = node.unwrap().child_mut(*path.get(i).unwrap());
}
}
return node;
}
pub fn deepth_first_search<F: FnMut(&T)>(&self, mut f: F) {
self.dfs_helper(&mut f);
}
fn dfs_helper<F: FnMut(&T)>(&self, f: &mut F) {
f(self.data());
for child in self.children() {
child.dfs_helper(f);
}
}
pub fn breadth_first_search<F: FnMut(&T)>(&self, mut f: F) {
let mut queue: VecDeque<&Node<T>> = VecDeque::new();
queue.push_back(self);
while let Some(node) = queue.pop_front() {
f(node.data());
for child in node.children() {
queue.push_back(child);
}
}
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn data_works() {
let s = format!("hello");
let mut node = Node::new(s.clone());
assert_eq!(node.data(), &s);
let s2 = format!("world");
let mut data = node.data_mut();
*data = s2.clone();
assert_eq!(node.data(), &s2);
}
#[test]
fn child_works() {
let s = format!("root");
let mut root = Node::new(s);
let level1_data = String::from("level1_1");
let level1_2_data = String::from("level1_2");
let level2_1_data = String::from("level2_1");
let level1 = Node::new(level1_data.clone());
let mut level1_2 = Node::new(level1_2_data.clone());
let level2_1 = Node::new(level2_1_data.clone());
level1_2.add(level2_1);
root.add(level1);
root.add(level1_2);
assert_eq!(root.children.len(), 2);
assert_eq!(root.child(0).unwrap().data(), &level1_data);
assert_eq!(root.child(1).unwrap().data(), &level1_2_data);
assert_eq!(root.child(0).unwrap().children.len(), 0);
assert_eq!(root.child(1).unwrap().children.len(), 1);
assert_eq!(
root.child(1).unwrap().child(0).unwrap().data(),
&level2_1_data
);
let level2_2_data = String::from("level2_2");
let level2_2 = Node::new(level2_2_data.clone());
let level1_2_mut_opt = root.child_mut(1);
assert!(level1_2_mut_opt.is_some());
let level1_2_new_data = String::from("level1_2_new_data");
let level1_2_mut = level1_2_mut_opt.unwrap();
*(level1_2_mut.data_mut()) = level1_2_new_data.clone();
assert_eq!(level1_2_mut.data(), &level1_2_new_data);
}
fn get_tree() -> Node<String> {
let s = format!("root");
let mut root = Node::new(s);
let level1_data = String::from("level1_1");
let level1_2_data = String::from("level1_2");
let level2_1_data = String::from("level2_1");
let level1 = Node::new(level1_data.clone());
let mut level1_2 = Node::new(level1_2_data.clone());
let level2_1 = Node::new(level2_1_data.clone());
level1_2.add(level2_1);
root.add(level1);
root.add(level1_2);
return root;
}
#[test]
fn child_path_works() {
let mut root = get_tree();
let root1: Option<&Node<String>> = root.child_by_path(&vec![0]);
assert!(root1.is_some());
assert_eq!(root1.unwrap().data(), &String::from("root"));
let level2_1 = root.child_by_path(&vec![0, 1, 0]);
assert!(level2_1.is_some());
assert_eq!(level2_1.unwrap().data(), &String::from("level2_1"));
}
fn get_tree2() -> Node<String> {
let s = format!("root");
let mut root = Node::new(s);
let level1_data = String::from("level1_1");
let level1_2_data = String::from("level1_2");
let level2_1_data = String::from("level2_1");
let level2_2_data = String::from("level2_2");
let level2_3_data = String::from("level2_3");
let mut level1 = Node::new(level1_data.clone());
let mut level1_2 = Node::new(level1_2_data.clone());
let level2_1 = Node::new(level2_1_data.clone());
let level2_2 = Node::new(level2_2_data.clone());
let level2_3 = Node::new(level2_3_data.clone());
level1_2.add(level2_1);
level1.add(level2_2);
level1.add(level2_3);
root.add(level1);
root.add(level1_2);
return root;
}
#[test]
fn traversal_works() {
let mut root = get_tree2();
let mut dfs_str = String::new();
let mut bfs_str = String::new();
root.deepth_first_search(|d| {
dfs_str = format!("{}-{}", dfs_str, d);
});
assert_eq!(
dfs_str,
String::from("-root-level1_1-level2_2-level2_3-level1_2-level2_1")
);
root.breadth_first_search(|d| {
bfs_str = format!("{}-{}", bfs_str, d);
});
assert_eq!(
bfs_str,
String::from("-root-level1_1-level1_2-level2_2-level2_3-level2_1")
);
}
}