Results for "depth first"

Depth first search directed graphs

Reduce any JSON value by traversing depth first and visiting each node

A terminal-based task manager with depth-first navigation.

Basic depth-first traversal function

Webpack cylic dependency checker. Does a depth-first traversal of webpack's stats.json output

Walk or map over objects in a depth-first preorder or postorder manner.

iterative deepening depth-first search (IDDFS) for JavaScript

Depth first traversal for recursive, asynchronous JavaScript functions.

For generic graph search: depth-first, breadth-first, ...

utilities for primitive JavaScript types

Walk any kind of tree structure depth- or breadth-first. Supports promises and advanced map-reduce operations with a very small API.

Collection of abstract data structures and algorithms to process graphs. The module does not bound to any specific format of a graph, so providing adapters toy may use it with anyone. It implements depth-first search, breadth-first search, extracting stro

Dependency ordering with depth first search

**xDeepObjectTraversal** is a recursive function that traverses a nested object and calls a callback function for each key-value pair it encounters. It is a depth-first traversal, meaning it explores as deeply into the nested objects as possible before mo

Get the Depth of a Multi-Dimensional Array of Values

iterate tree structure using Depth-first search(DFS) and Breadth-first search(BFS) algorithms for traversing or searching

Traversal functions for graphology.

Perform a depth first walk of a poset expressed as an adjacency list.

Weighted dependency sorter, based on a depth-first topological sort

This method does a depth first removal of "empty" values ( [], {}, '') from collections (arrays & objects).