trailduck
a topological cyclic sorting algorithm based on depth-first search (dfs)
a topological cyclic sorting algorithm based on depth-first search (dfs)
Deep iteration of any object or iterable collection.
Syntax analysis. Lot of different methods.
node tree
Just Tree algorithms.
Small module for graph traversals, supporting DFS and BFS with niceties added for pre- and post-order, including their reverses.
Depth first search directed graphs
Enhanced and multifunctional tree walker
A library of data structures and algorithms
A generic DAG visitor for use in JavaScript
Guard against loops during tree/graph traversal
Javascript Implementation of Binary Search Tree
Traversal functions for graphology.
Graph data structure with path finding and traversing algorithms
DAGs on top of hypercore, allowing verified random-access to graph nodes
Allows you to do a depth-first-search through DOM elements.
JavaScript Data Structure
Walk DOM with BFS and DFS traversing algorithms
Graph data structure with path finding and traversing algorithms
Run dfs on a json array