Awesome GitHub RepositoriesNode-Tree Data Models

Lexical is a modular rich text editor framework used to build extensible web-based editors. It functions as a state-driven content editor that maintains a serializable, immutable snapshot of document content to ensure predictable updates and accessibility compliance. The framework is distinguished by its plugin-based architecture and customizable node framework, which allow developers to extend editor behavior through specialized content nodes and encapsulated runtime logic. It also includes a collaborative editing engine capable of synchronizing document state across multiple clients in real

Flowgram.ai is a workflow development framework for building AI workflow platforms. It provides a visual drag-and-drop canvas for constructing workflows, an Entity-Component-System (ECS) based document model for structuring workflow nodes as a tree, and a node-based form engine for managing configuration forms with built-in rendering, validation, side effects, and error handling. The framework also includes a workflow execution engine that parses directed graph workflows and runs nodes step by step with state tracking and array iteration. The framework distinguishes itself through a layered r

MobX State Tree is a structured, tree-based state management library for JavaScript applications that combines typed model definitions with reactive snapshots and patch-based change tracking. It provides a reactive state container with runtime and compile-time type safety, where application state is defined as a tree of typed models with collocated actions, computed views, and lifecycle hooks for predictable state mutations. The library is built around an action-centric mutation model that encapsulates all state changes within named functions that directly modify the tree, supported by genera

yaml-cpp is a C++ library for parsing and emitting YAML 1.2 documents. It provides a complete YAML processing pipeline, from reading YAML content into a traversable node tree to writing in-memory data structures back as YAML text. The library represents parsed YAML as a mutable tree of typed nodes, supporting scalars, sequences, maps, and aliases. It uses a recursive-descent parser to build this node tree, and a stream-based emitter to generate YAML output incrementally. Template-based type conversion enables compile-time serialization between YAML nodes and C++ types, including support for c

Effector is a reactive state management library designed for building complex, event-driven applications. It functions as a data flow engine that models application logic as a directed acyclic graph, ensuring that state updates propagate automatically through interconnected nodes. By utilizing atomic state updates and declarative unit composition, the library maintains data consistency and provides a predictable execution model for managing application state. The project distinguishes itself through its framework-agnostic architecture, which decouples business logic from user interface implem

Jackson-databind is a Java serialization framework and JSON data binding library used to convert Java objects to JSON and vice versa. It functions as a JSON streaming API that generates and parses content as a sequence of tokens, and as a hierarchical data tree mapper that reads data into a node structure for dynamic modification without predefined classes. The project provides a structured mapping process to bind data to objects, allowing for the transformation of complex Java objects into data formats and the reconstruction of objects from those formats. It supports custom data format mappi

Este proyecto es una guía de referencia completa para fundamentos de ciencias de la computación, proporcionando resúmenes estructurados de estructuras de datos esenciales y principios algorítmicos. Sirve como un recurso técnico para que los desarrolladores repasen conceptos básicos de programación, layouts de memoria y características operativas requeridas para el desarrollo de software y evaluaciones técnicas. La colección se distingue por ofrecer documentación concisa y enfocada en la implementación para una amplia gama de técnicas estándar. Cubre la mecánica de varios algoritmos de ordenamiento y búsqueda, estrategias de recorrido de grafos y árboles, y la gestión de estructuras de datos fundamentales como tablas hash, listas enlazadas y heaps. Cada entrada incluye un análisis de complejidad computacional para ayudar a los desarrolladores a evaluar el rendimiento y la escalabilidad de diferentes enfoques. El repositorio organiza esta información en archivos markdown estáticos, facilitando la navegación rápida y la revisión de temas técnicos. Abarca una amplia superficie de conocimiento, desde patrones de diseño recursivos básicos y paradigmas algorítmicos hasta la lógica operativa específica requerida para mantener y manipular jerarquías de datos complejas.