29 repository-uri
Algorithms for exploring paths through grids, trees, or linked structures to identify optimal routes.
Distinct from Recursive Structure Processors: Distinct from Recursive Structure Processors: focuses on pathfinding and route identification rather than general processing.
Explore 29 awesome GitHub repositories matching data & databases · Recursive Structure Traversers. Refine with filters or upvote what's useful.
Python Fire is a library that automatically generates command line interfaces from any Python object, function, or class. It removes the need for manual argument parsing by mapping Python dictionaries, lists, and classes directly to terminal commands. The tool converts Python docstrings into formatted terminal help screens and produces shell scripts to enable tab-completion for available commands. It can wrap existing libraries or external modules to expose their functionality via the terminal without requiring modifications to the original source code. The library supports hierarchical comm
Navigates nested classes and dictionaries to resolve hierarchical command paths during the execution phase.
SwiftyJSON is a Swift JSON parsing library and data wrapper designed to simplify the reading and manipulation of JSON structures. It provides a toolkit for converting raw JSON strings into structured formats without requiring manual type casting or optional chaining for every value. The library focuses on simplifying nested data extraction through subscript-based value access and recursive data resolution. It ensures optional-safe value retrieval by returning default empty values instead of crashing when encountering missing keys or out-of-bounds array indices. The project includes capabilit
Enables recursive traversal of deep JSON hierarchies to resolve nested objects and arrays.
This project is a static code analysis tool and local-first code indexer that builds a persistent dependency graph of functions, classes, and imports. It functions as an AI context optimizer and codebase dependency graph, designed to reduce token usage by providing AI assistants with only the most relevant code fragments and impact analysis for a given change. The system implements a Model Context Protocol server that exposes code intelligence and architectural graph queries to external AI coding tools. It distinguishes itself by computing the change blast radius and risk scores of modificati
Limits graph traversal depth to maintain performance and stability when analyzing very large repositories.
Photon is a command-line web crawler designed for security reconnaissance and information gathering. It systematically traverses websites to discover URLs, map domain infrastructure, and identify associated subdomains by retrieving DNS records. The tool distinguishes itself through its ability to perform deep content analysis, including the extraction of sensitive data such as API keys and authentication tokens using user-defined regular expressions. It supports offline inspection by cloning crawled web content to the local filesystem, allowing for structural analysis without additional netwo
Maintains a dynamic queue of discovered URLs to systematically navigate website structures.
This project is a comprehensive library of reference implementations for fundamental data structures and algorithms, designed to support technical interview preparation and software engineering assessments. It provides a structured collection of computational techniques for solving complex problems involving arrays, strings, graphs, trees, and mathematical analysis. The library distinguishes itself by offering specialized implementations for advanced topics, including concurrent programming patterns and geometric algorithms. It features thread-safe primitives for managing shared state and tas
Explores paths through grids, trees, or linked structures to identify specific sequences or optimal routes.
This project is an open-source 3D game engine designed for building high-fidelity games, simulations, and cinematic environments. It functions as a robotics simulation platform with native integration for ROS 2 to model robot controllers and sensors. The engine features a multi-threaded Forward+ physically based renderer that supports hardware-accelerated ray tracing and global illumination. The system is built on a modular extension architecture using Gems to add or replace features without modifying core binaries. It includes a native SDK for AWS cloud integration, enabling IAM authenticati
Recursively visits JSON objects and arrays to process child fields or serialize complex configuration objects.
itsy-bitsy-data-structures is a collection of fundamental computer science data structures implemented in JavaScript. It serves as an educational resource and algorithm study guide, providing simplified code implementations of classic data organization patterns to demonstrate internal logic and usage. The project provides clear and concise JavaScript implementations of stacks, queues, and linked lists. These examples are designed for learning, technical interview preparation, and studying the mechanical behavior of core data structures through code. The implementations utilize various comput
Employs recursive logic to navigate and process hierarchical data structures.
MJExtension is a JSON serialization library and model mapping framework used to convert data between JSON strings and structured model objects. It functions as an object data mapper that handles the encoding and decoding of complex object hierarchies for network transmission and storage. The framework is a non-intrusive data mapper that uses reflection and runtime inspection to map raw data strings to application objects. This approach allows for data transformation without requiring base class inheritance, decorators, or extensions to the underlying model classes. The system supports recurs
Recursively traverses nested JSON structures and arrays to instantiate corresponding model types.
This project is a computer science educational resource and library providing implementations of data structures and algorithms in JavaScript. It serves as an algorithm implementation reference and a toolkit for building foundational data containers, including a collection of sorting algorithms and a guide for learning time and space complexity. The project differentiates itself by pairing class-based implementations with Big O analysis to illustrate asymptotic complexity. It includes a non-linear data structure toolkit featuring self-balancing trees, hash maps, and graphs, alongside comparis
Supports traversing linked lists, trees, and graphs using both iterative loops and recursive calls.
Universal Ctags is a multi-language symbol indexer and regex-based parsing engine used to extract and catalog functions, classes, and variables from source code. It functions as a source code indexer that scans files across diverse programming languages to create searchable catalogs of definitions and declarations. The project is distinguished by its extensible parser framework, which allows users to define new language rules using regular expressions and configuration files. It supports complex parsing scenarios through state-based parsing, stack-oriented scope tracking, and guest-parser del
Creates reverse mappings between parents and children to iterate through objects within a specific scope.
ArduinoJson is a C++ library for parsing and manipulating JSON data and MessagePack binary streams on microcontrollers with limited memory and processing power. It provides the core primitives necessary for embedded data serialization and parsing, enabling devices to exchange structured data over serial or network interfaces. The library is distinguished by its focus on microcontroller memory management, employing strategies such as pool-based allocation, string deduplication, and non-owning string views to minimize RAM usage. It further optimizes for constrained environments by allowing cons
Recursively traverses nested JSON documents to locate specific keys and their associated values.
Pry is a programmable Ruby shell, REPL console, and runtime developer environment. It serves as a debugging toolkit for inspecting object state, navigating bindings, and evaluating code within a running Ruby program. The project differentiates itself through advanced introspection and live iteration capabilities. It allows users to inject an interactive console into a running program at specific points to inspect local state and navigate different object scopes. It further enables live code iteration by integrating with external system editors to modify and reload method definitions without r
Moves the session context into different objects or namespaces using directory-like syntax to explore internal state.
Object-enumerator is a data structure crawler and enumeration library designed to discover and list all objects stored within deep or circular data references. It functions as a traversal tool that recursively walks through nested arrays and object graphs to identify every individual referenced object. The library flattens complex hierarchical data structures into a linear collection of unique objects. This process enables data structure analysis and memory reference mapping by tracing all objects connected to a root element to understand the overall composition of a data set.
Provides recursive traversal mechanisms to visit every reachable node within nested arrays and object graphs.
go-spew is a deep inspection library and debugging utility for Go. It functions as a data structure pretty printer that renders complex, nested types into human-readable strings with indentation and type information. The library provides specialized capabilities for visualizing internal program states, including the ability to dump data structures with pointer addresses and map keys. It includes a configuration system to adjust printing behavior, such as limiting recursion depth and setting indentation. The tool uses reflection-based type inspection and recursive tree traversal to handle nes
Recursively traverses pointers, slices, and maps to produce a comprehensive deep-print representation of Go types.
Acest proiect este o bibliotecă de algoritmi C# și o colecție de structuri de date. Servește ca referință de informatică oferind implementări practice ale tiparelor clasice de sortare, căutare și traversare a grafurilor. Biblioteca include un set de instrumente dedicat procesării șirurilor pentru analizarea similitudinii textului, calcularea distanțelor de editare și gestionarea căutărilor bazate pe prefix. De asemenea, dispune de o implementare a teoriei grafurilor pentru modelarea relațiilor de rețea și calcularea celor mai scurte căi. Codul sursă acoperă o gamă largă de capabilități, inclusiv gestionarea colecțiilor liniare și ierarhice, manipularea și vizualizarea structurilor de date de tip arbore și calcularea secvențelor numerice matematice.
Provides methods for visiting all nodes in trees and graphs using recursive and iterative traversal patterns.
Datascript este un magazin de stare imutabil, în memorie, și un magazin de triplete bazat pe schemă. Gestionează starea aplicației ca o bază de date versionată, stocând datele ca fapte imutabile constând dintr-o entitate, atribut, valoare și tranzacție. Proiectul oferă un motor logic pentru executarea interogărilor Datalog cu suport pentru join-uri implicite, reguli recursive și negație. De asemenea, dispune de un API declarativ de tip „pull” pentru preluarea grafurilor de entități profund imbricate și a structurilor de date conexe. Baza de date impune integritatea datelor prin constrângeri bazate pe schemă și tipuri de atribute. Suportă tranzacții atomice, protocoale de stocare pluggable pentru persistență și indexarea atributelor B-tree pentru a optimiza căutările. Sistemul este conceput pentru utilizare în medii Clojure, ClojureScript și JavaScript.
Uses a Datalog engine to execute complex lookups including recursive rules and transitive closures.
seL4 is a formally verified microkernel whose C implementation is backed by machine-checked mathematical proofs of correctness, confidentiality, integrity, and availability. It enforces strict isolation between processes through hardware-enforced address space separation and a capability-based access control system, where each process holds explicit rights only to the resources it has been granted. The kernel exposes hardware resources through a minimal API of system calls that manage threads, address spaces, and inter-process communication, with synchronous IPC supporting sender-identifying b
Declares nested object structures with qualified names and dimensions for system capability specification.
jsondiffpatch este o bibliotecă de diff și patch JSON concepută pentru a calcula diferențele dintre două obiecte JSON și a aplica acele modificări pentru a sincroniza stările. Funcționează ca un instrument de sincronizare pentru calcularea delta-urilor și aplicarea patch-urilor pentru a actualiza sau a reveni la stări anterioare ale obiectelor JavaScript complexe imbricate. Proiectul oferă o implementare conformă cu standardul RFC 6902 JSON Patch pentru actualizări atomice și un renderer vizual de diferențe care convertește delta-urile de date în vizualizări HTML lizibile pentru oameni. Include un instrument specializat de text diff pentru efectuarea unei analize fine, la nivel de caracter, asupra șirurilor lungi din valorile datelor JSON. Biblioteca acoperă o gamă largă de capabilități, inclusiv generarea recursivă de delta-uri și calcularea diferențelor de array-uri folosind algoritmi de tip Longest Common Subsequence. Suportă diffing-ul logic al array-urilor pentru a detecta mutările de elemente prin hashing personalizat și oferă opțiuni de ieșire în mai multe formate, cum ar fi formatarea colorată în consolă și o componentă React dedicată pentru comparații vizuale.
Traverses nested JSON structures to produce a hierarchical tree of modifications representing deep differences.
Biopython este o bibliotecă de bioinformatică pentru Python care oferă instrumente pentru a analiza, manipula și interpreta secvențe biologice, structuri moleculare și arbori filogenetici. Servește ca un parser de secvențe biologice pentru date genomice și proteomice în mai multe formate de fișiere standard din industrie și acționează ca o interfață pentru interogarea datelor biologice și a citărilor din depozitele NCBI Entrez. Proiectul se distinge prin seturi de instrumente specializate pentru analiza structurii proteinelor și construcția arborilor filogenetici. Include un analizor de structură proteică pentru procesarea fișierelor PDB și mmCIF pentru a calcula geometria moleculară, precum și un set de instrumente pentru arbori filogenetici pentru analizarea relațiilor evolutive dintre specii. Biblioteca acoperă o gamă largă de capabilități de bioinformatică, inclusiv analiza secvențelor genomice pentru transcriere și traducere, gestionarea alinierilor de secvențe și calcule de genetică a populațiilor. Oferă, de asemenea, instrumente de analiză structurală pentru manipularea coordonatelor atomice 3D, precum și utilitare pentru vizualizarea caracteristicilor genomice și modelarea datelor biogeografice. Sistemul se integrează cu binare externe de bioinformatică prin „wrapping” și suportă stocarea persistentă a înregistrărilor biologice prin stocare de secvențe bazată pe SQL.
Traverses structural data using a hierarchical model of structures, models, chains, residues, and atoms.
ZLinq is a zero-allocation LINQ library and memory-efficient collection toolkit for C#. It provides a high-performance replacement for standard query operations by using value-type enumerators and pooled memory to eliminate heap allocations and reduce garbage collection overhead. The library features a C# source generator that automatically routes standard query method calls to these zero-allocation implementations. It further accelerates data processing through a SIMD accelerated data library, using hardware vectorization for numeric aggregations and bulk operations on primitive arrays and s
Navigates parent-child relationships in scene graphs and object trees to find ancestors and descendants.