Message from JavaScript talks

May 2017

— You could make it extendable

— 

Run a user-defined function per node, and / or a function that returns a boolean to know to traverse a subtree or not

— Maybe implement something similar to map and filter

— Definitely! Thats the goal is extensibility

— The traversal algorithm just uses the iterator protocol, too

— Rather than yielding the node it yields a shared state object, containing a tuple of nodes

— It was depth-first, right?

— Iterative depth first traversal, runs like a hybrid between dfs and bfs

— Wat

— Https://en.m.wikipedia.org/wiki/Iterative_deepening_depth-first_search

— How the hell can it work as a hybrid

— Oops im on phone if thats mobile version, haha