Be concise.
Be useful.
All contributions dictatorially edited by webmasters to match personal tastes.
Please do not paste any copyright violating resource.
Please try to avoid dependencies to third-party libraries and frameworks.
void dfs(const auto &tree, const auto &root) { f(root); for (auto child : tree) dfs(tree, child); }
void prefixOrderTraversal(alias f)(ref Tree tree) { f(tree); foreach (child; tree.children) prefixOrderTraversal!f(child); }
traverse(Tree node, f(value)) { f(node.value); for (var child in node.children) { traverse(child, f); } }
func (t *Tree) Dfs(f func(*Tree)) { if t == nil { return } f(t) for _, child := range t.Children { child.Dfs(f) } }
preordered (Node pivot left right) = pivot : preordered left ++ preordered right preordered Ø = [] f <$> (preordered tree)
function DFS(f, root) { f(root) if (root.children) { root.children.forEach(child => DFS(f, child)) } }
function dfs($f, $root) { $f($root); foreach($root as $child) { dfs($child); } }
sub depth_first_traversal { my ($f, $treenode) = @_; $f->($treenode); depth_first_traversal($f, $_) for @{$treenode->{children}}; }
def DFS(f, root): f(root) for child in root: DFS(f, child)
def dfs(f, node) f.(node) node.children.each do |child| dfs(f, child) end end
pub struct Tree<V> { children: Vec<Tree<V>>, value: V } impl<V> Tree<V> { pub fn dfs<F: Fn(&V)>(&self, f: F) { self.dfs_helper(&f); } fn dfs_helper<F: Fn(&V)>(&self, f: &F) { (f)(&self.value); for child in &self.children { child.dfs_helper(f) } } // ... }