Package: node-deep-for-each (1.0.6+dfsg-1)
Links for node-deep-for-each
Download Source Package node-deep-for-each:
- Homepage [github.com]
Recursively iterates collection values (arrays and objects)
The iteration is made using a deep-first algorithm.
Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible along each branch before backtracking.
Other Packages Related to node-deep-for-each