40 packages found
Library to simplify JSON, replacing circular and repeated structures by the path leading to the first time this structure happens (in breadth-first search).
Syntax analysis. Lot of different methods.
Call a function on each file in a filesystem tree
nv-facutil-json-readonly-visitor ================================ - nv-facutil-json-readonly-visitor - simplified version of nvjson, BUT only support read-only - flatten json - json read-only visitor - bfs - pre-dfs - post-dfs - begin-end-dfs
Graph data structure with path finding and traversing algorithms
- find path
- path finder
- shortest path
- depth first search
- bredth first search
DirectedGraph container class + BFT/DFT/transpose algorithms inspired by Boost C++ Graph Library API.
- depth-first search
- breadth-first search
- data modeling
- View more
Find all/least-cost routes in weighted directed graph with given limitations
Index computations for balanced binary trees stored in BFS order
Flexible functional async breadth first search
Converts BFS tree indexes to inorder tree indexes
DAGs on top of hypercore, allowing verified random-access to graph nodes
Breadth-first search a tree
Use classic algorithms for Graphs.
Fetching, cleaning, transforming of pharmaceutical data from public resources