5 مستودعات
Operations to remove vertices and their associated edges from a graph database.
Distinct from Graph Node Filtering: The candidates refer to AST nodes, DOM nodes, or linked list algorithms, not graph database vertex deletion.
Explore 5 awesome GitHub repositories matching data & databases · Graph Node Deletions. Refine with filters or upvote what's useful.
GoJS is a JavaScript diagramming library and canvas-based visualization engine used to build interactive flowcharts, organizational charts, and network diagrams. It functions as a data-driven framework that binds JavaScript data models to visual elements, enabling bidirectional synchronization between the underlying data and the graphical representation. The library features a comprehensive graph layout engine capable of automatically arranging nodes into trees, grids, circles, or force-directed layouts. It distinguishes itself through a template-based system for generating visual parts and a
Ensures that deleting a parent node automatically removes all of its descendant children.
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
Ships a detach function that removes a node from its parent and turns it into an independent tree.
Apache AGE is a graph database extension for PostgreSQL that adds openCypher graph query capabilities directly within the relational database environment. It functions as a loadable extension that translates Cypher graph traversal queries into SQL expressions, enabling users to run pattern matching and path analysis alongside standard SQL operations within a single database instance. The extension stores labeled, directed property graphs as isolated schemas with internal relational tables for vertices, edges, and labels, preventing cross-graph interference. It supports hybrid query execution
Removes nodes, relationships, or paths from a graph database using the DELETE clause.
Memgraph is an in-memory, distributed graph database designed for high-performance labeled property graph management. It utilizes a Cypher query engine for declarative data retrieval and manipulation, providing a scalable knowledge graph backend that integrates vector search and graph traversals. The system distinguishes itself as a real-time graph analytics platform, employing native C++ and CUDA implementations to execute complex network analysis and dynamic community detection on streaming data. It provides specialized support for AI integration, including GraphRAG capabilities, the constr
Provides the ability to remove specific nodes and their connected relationships to clean up the graph.
Ancestry is a materialized path tree library for managing hierarchical data models in relational databases. It provides a framework for organizing records into tree structures, allowing for the efficient retrieval of ancestors and descendants through path-based storage. The project distinguishes itself through specialized tools for maintaining tree integrity and transforming data. It includes a tree integrity manager to handle orphaned nodes and a JSON tree serializer that converts hierarchical database records into nested hashes or arrays for API responses. The library covers a broad range
Defines strategies for children of deleted nodes, including destroying, promoting, or reassigning them.