Depth-first search for directed graphs
Reduce any JSON value by traversing depth first and visiting each node
Basic depth-first traversal function
Depth first traversal for recursive, asynchronous JavaScript functions.
Walk or map over objects in a depth-first preorder or postorder manner.
Webpack cylic dependency checker. Does a depth-first traversal of webpack's stats.json output
A terminal-based task manager with depth-first navigation.
iterative deepening depth-first search (IDDFS) for JavaScript
Dependency ordering with depth first search
Depth First Graph Algorithm
Map a tree of arrays in pre-order depth-first
For generic graph search: depth-first, breadth-first, ...
a topological cyclic sorting algorithm based on depth-first search (dfs)
utilities for primitive JavaScript types
Perform a depth first walk of a poset expressed as an adjacency list.
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
This method does a depth first removal of "empty" values ( [], {}, '') from collections (arrays & objects).
iterate tree structure using Depth-first search(DFS) and Breadth-first search(BFS) algorithms for traversing or searching
A package to generate mazes using the depth first or hunt and kill algorithm. Mazes can be generated with seed values for reproducibility
Spavn UI - Vue 3 component library with depth-first design
A factory that returns an optionally-typed, Tree data structure instance with breadth- and depth-first searching capabilities.
Walk any kind of tree structure depth- or breadth-first. Supports promises and advanced map-reduce operations with a very small API.
Allows you to do a depth-first-search through DOM elements.
Identify price fractals using Depth-First Search with Fibonacci Numbers
Generic and lazy tree traversal algorithms
Vector-buffered tree collection with pre-/post-order, depth-first, mutable/immutable iterator
A simple and efficient tree structure library for Rust with recursive traversal
A library providing basic generic depth-first, breadth-first, heuristic-guided, and A* search space exploration algorithms.
A WebSocket client for interacting with the Satori database.
X509 Path Finder is a depth-first search certificate path validator for Rust.
Work with directed graphs.
A fast and small memory maze generator.
A GNU Find-like tool, but uses breadth-first search instead of depth-first search
Extra generators for the Protest property testing library
wiztree-metafile
A scalable abstraction learning library
Chain together code tasks similar to Unix pipes
A DepthFirst visitor for Arel (removed from Rails in 6.1).
Work with your tests, not against them.
PathGenerator is a microgem that generates, depth-first, paths from a structure.
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.
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.
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
QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net 2.0 and up. QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc... QuickGraph supports MSAGL, GLEE, and Graphviz to render the graphs, serialization to GraphML, etc...
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
Contentful API wrapper library exposing an ActiveRecord-like interface
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.