Find the path of a value in a complex JavaScript object graph/tree
General purpose BFS implementation.
An emulation of Node's path module. Used in BrowserFS.
bfs upload compoents
Blast radius analysis via reverse dependency graph + BFS traversal
Index computations for balanced binary trees stored in BFS order
Breadth-first search (BFS) using promise (Bluebird)
webComponent+capacitor @bfs
<img src="https://article.biliimg.com/bfs/article/b2fca8e0d573c6c4b23f8dbefc656b3bb845a6f8.png" width="200" style="display: block;margin: 0 auto;">
bfs ng components
The SCSS foundation of the **Bold Foundation System (BFS)** — a design-token-driven stylesheet that ships compiled CSS, raw SCSS sources, theme overrides, mixins, and webfonts.
Alias for create-better-fullstack - A CLI-first toolkit for building fullstack applications.
Shortest path between any two nodes in any connected graph. BFS and Dijkstra. Zero dependencies.
创建和扩展指令！可以实现 [一键打卡](https://i0.hdslb.com/bfs/article/c3a90e76082632cd5321d23582f9bc0d312276085.png)、[分群调用](https://i0.hdslb.com/bfs/article/b130e445dcfe99a89e841ee7615a4e61312276085.png)、[定时执行](https://i0.hdslb.com/bfs/article/82c273ef4d4eda1e8523686e8be5
Traversal functions for graphology.
Breadth-first search traversal of an acorn-generated AST.
BFS planner over affordance graphs — cost-aware planning with preconditions, effects, and template parameters
A package to offer a built-in Queue data structure and Breadth First Search (BFS) method for traversing a graph for JavaScript applications.
[<ruby>保存图片<rp>（</rp><rt>点我查看食用方法</rt><rp>）</rp></ruby>](https://www.npmjs.com/package/koishi-plugin-image-save-path) 💾支持[交互保存图片](https://i0.hdslb.com/bfs/article/a2780975ccbf74c422dd7f0333af0172312276085.png) 、 [回复保存图片](https://i0.hdslb.com/bfs/article/
Backup File System — distributed backup with Reed-Solomon erasure coding
Visualize graphs, simulate common graph algorithms (Kruskal, Dijkstra, BFS, DFS, etc.), and record your own graph animations.
bfs
Graph data structures with BFS, DFS, Dijkstra's shortest path, topological sort, cycle detection, and connectivity
bfs dweb_browser
A tool to find files on your disk with breadth first search
tree_iterators_rs is a library built to provide you with the iterators to easily work with tree data structures in Rust.
A BFS pathfinder & collision system
Create SCO BFS (Boot File System) images
A beautiful tree 🌳 with convenient, efficient, parallelizable growth, mutation and traversal features.
Selective test runner for Rust workspaces. Runs only the tests affected by a code change, by driving rust-analyzer over LSP.
A tool for BFS (Bugbear File System) archives
A Rust implementation of BLEST: Blazingly Efficient BFS using GPU Compute Shaders
Generic 3D BFS light propagation with two-phase removal for voxel engines
GPU-first embedded graph database for code analysis (call graphs, dependencies, AST traversals)
GPU-accelerated graph algorithm primitives for RingKernel (CSR, BFS, SCC, Union-Find, SpMV)
A Rust library for building and querying knowledge graphs using SQLite as the backend, with graph algorithms, vector search, and RAG support
Minimalist abstraction for bucket storage
https://github.com/bsm/bfs.rb
https://github.com/bsm/bfs.rb
https://github.com/bsm/bfs.rb
https://github.com/bsm/bfs.rb
https://github.com/bsm/bfs.rb
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.
Encrypts using BF-CFB
convert any string in BF code
BFS webcrawler that implements Observable
Fifteen Puzzle Solver - BFS, DFS, A*
This gem employs Breadth-First-Search or Depth-First-Search to search whether an element is in a tree.
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.