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

A lightweight tree traversal library for depth first searching and changing nested objects

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

A configurable implementation of negamax depth-first tree search with alpha-beta pruning

Traversal functions for graphology.

Spavn UI - Vue 3 component library with depth-first design

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

Get the list of files installed in a package in node_modules, including bundled dependencies

Recursive matching plugin for Regex+

**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

Limit the depth allowed in a GraphQL query.

Get the path of the caller function

Underscore mixins for deeply nested objects

Get the callsite of the caller function

Get the Depth of a Multi-Dimensional Array of Values

Traverse file system either breadth-first or depth-first.

A factory that returns an optionally-typed, Tree data structure instance with breadth- and depth-first searching capabilities.

Infer the scope of each token in an array of GLSL tokens

Determine the scope depth of an array of GLSL tokens

A data structure that combines a hash and an array for fast dictionary lookup and traversal by complex keys.