awesome-repositories.com
ब्लॉग
awesome-repositories.com

AI-संचालित खोज के साथ बेहतरीन ओपन-सोर्स रिपॉजिटरी खोजें।

एक्सप्लोर करेंक्यूरेटेड खोजेंOpen-source alternativesSelf-hosted softwareब्लॉगसाइटमैप
प्रोजेक्टहमारे बारे मेंHow we rankप्रेसMCP सर्वर
कानूनीगोपनीयताशर्तें
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

5 रिपॉजिटरी

Awesome GitHub RepositoriesGraph Node Deletions

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.

Awesome Graph Node Deletions GitHub Repositories

AI के साथ बेहतरीन रिपॉजिटरी खोजें।हम AI का उपयोग करके सबसे सटीक रिपॉजिटरी खोजेंगे।
  • northwoodssoftware/gojsNorthwoodsSoftware का अवतार

    NorthwoodsSoftware/GoJS

    8,447GitHub पर देखें↗

    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.

    HTMLcanvaschartcharts
    GitHub पर देखें↗8,447
  • mobxjs/mobx-state-treemobxjs का अवतार

    mobxjs/mobx-state-tree

    7,050GitHub पर देखें↗

    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.

    TypeScripthacktoberfestmobxmobx-state-tree
    GitHub पर देखें↗7,050
  • apache/ageapache का अवतार

    apache/age

    4,236GitHub पर देखें↗

    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.

    Cage-databaseagensgraphanalytics
    GitHub पर देखें↗4,236
  • memgraph/memgraphmemgraph का अवतार

    memgraph/memgraph

    4,163GitHub पर देखें↗

    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.

    C++cyphergraphgraph-algorithms
    GitHub पर देखें↗4,163
  • stefankroes/ancestrystefankroes का अवतार

    stefankroes/ancestry

    3,853GitHub पर देखें↗

    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.

    Ruby
    GitHub पर देखें↗3,853
  1. Home
  2. Data & Databases
  3. Graph Node Deletions

सब-टैग एक्सप्लोर करें

  • Cascading DeletionsAutomatic removal of all descendant nodes when a parent node is deleted. **Distinct from Detached Node Deletions:** Focuses on hierarchical parent-child deletion rather than just removing incident edges (detached delete).
  • Detached Node Deletions1 सब-टैगRemoves a vertex and all its incident edges in a single operation. **Distinct from Graph Node Deletions:** Distinct from Graph Node Deletions: focuses on the DETACH DELETE pattern that removes both node and edges atomically.
  • Orphaned Node RecoveryStrategies for reassigning, promoting, or destroying nodes that lose their parent reference in a graph or tree. **Distinct from Graph Node Deletions:** Distinct from Graph Node Deletions: focuses on the strategy for the remaining child nodes (orphans) rather than the act of deleting the vertex.