Breadth-first deep object filter
Walk any kind of tree structure depth- or breadth-first. Supports promises and advanced map-reduce operations with a very small API.
Simple breadth-first early terminating Levenshtein distance auto correcter for small sets of possible resulting strings.
Breadth-first search for directed graphs
A breadth-first search path finder.
Breadth-first GraphQL executor
Breadth-first search traversal of an acorn-generated AST.
Breadth First Graph Algorithm
breadth-first and deep-first recursive searches for LevelGraph
Flexible functional async breadth first search
A small library that does a breadth-first walk of the file system, and emits (customizable) events on the way.
Breadth-first search (BFS) using promise (Bluebird)
Visitor DOM crawler, supporting breadth-first & in-order traversal.
A 3D Matrix Maze Algorithm that uses breadth first search
For generic graph search: depth-first, breadth-first, ...
Crawl the web breadth-first from a seed url, statefully
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
Breadth-first search for js value
iterate tree structure using Depth-first search(DFS) and Breadth-first search(BFS) algorithms for traversing or searching
Breadth-first search a tree
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
Allows you to do a breadth-first-search through DOM elements.
Traverse file system either breadth-first or depth-first.
ParcelJS plugin to load glob assets in breadth-first sorted order
Breadth-first `zip` guaranteeing a monotonically increasing sum of indices.
A library providing basic generic depth-first, breadth-first, heuristic-guided, and A* search space exploration algorithms.
This library provides a variety of path finding and graph operations. Work in progress.
This library provides a variety of path finding and graph operations. Work in progress.
Square coordinates and grid-like arrays, with zero dependencies, in a single file
wiztree-metafile
Breadth-first `zip` guaranteeing a monotonically increasing sum of indices.
Property-based testing with `#![no_std]` compatibility, automatic edge cases, and exhaustive breadth-first search over arbitrary types.
Work with directed graphs.
A breadth-first search path finder.
A GNU Find-like tool, but uses breadth-first search instead of depth-first search
Fast generic implementation of breadth-first search using disk storage, suitable for extremely large implicit graphs.
Provides an API for representing the initial state and allowed next states of a puzzle, reachable through user defined moves. The framework also provides a simple solver which will lazily evaluate all the states in a breadth first manner to find a solution state, returning the list of moves required to transition from the initial state to solution state.
A generic tree data structure supporting depth-first and breadth-first traversal, node search, path finding, and hash serialization. Each node tracks its parent, children, depth, height, and size.
This gem employs Breadth-First-Search or Depth-First-Search to search whether an element is in a tree.
Fully featured tree implementation for Mongoid using materialized paths and relative associations. Featuring Depth and Breadth first search.
In Order Traversal , Pre Order Traversal , Post Order Traversal,Breadth First Traversal , Deep Search Traversal
This module implements ordered n-ary branching tree structures. It includes support for breadth- and depth- first iteration, and serialization to and from a bracketed tree string.
Breadth first search an HTML page and spit out all the branches of the tree as CSS selectors. Simple filtering is currently hardcoded to ignore HTML tags that we don't style.
GRATR is a framework for graph data structures and algorithms. This library is a fork of RGL. This version utilizes Ruby blocks and duck typing to greatly simplfy the code. It also supports export to DOT format for display as graphics. GRATR currently contains a core set of algorithm patterns: * Breadth First Search * Depth First Search * A* Search * Floyd-Warshall * Best First Search * Djikstra's Algorithm * Lexicographic Search The algorithm patterns by themselves do not compute any meaningful quantities over graphs, they are merely building blocks for constructing graph algorithms. The graph algorithms in GRATR currently include: * Topological Sort * Strongly Connected Components * Transitive Closure * Rural Chinese Postman * Biconnected
RubyTree is a Ruby implementation of the generic tree data structure. It provides simple APIs to store named nodes, and to access, modify, and traverse the tree. The data model is node-centric, where nodes in the tree are the primary structural elements. It supports all common tree-traversal methods (pre-order, post-order, and breadth first). RubyTree mixes in the Enumerable and Comparable modules and behaves like a standard Ruby collection (iteration, comparison, etc.). RubyTree also includes a binary tree implementation, which provides in-order node traversal besides the other methods. RubyTree can import from and export to JSON, and supports Ruby’s object marshaling.
GRATR is a framework for graph data structures and algorithms. This library is a fork of RGL. This version utilizes Ruby blocks and duck typing to greatly simplfy the code. It also supports export to DOT format for display as graphics. GRATR currently contains a core set of algorithm patterns: * Breadth First Search * Depth First Search * A* Search * Floyd-Warshall * Best First Search * Djikstra's Algorithm * Lexicographic Search The algorithm patterns by themselves do not compute any meaningful quantities over graphs, they are merely building blocks for constructing graph algorithms. The graph algorithms in GRATR currently include: * Topological Sort * Strongly Connected Components * Transitive Closure * Rural Chinese Postman * Biconnected
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.