Traverse graphs super fast while keeping memory consumption low.
This library is mostly for finding descandants/ancestors in a directed-graph or tree.
Graphs with cycles are also fine, as we always check if a node was already seen ...
- Add docs with examples