Remove a node permanently from the graph. Optionally delete all connected edges simultaneously, or fail if edges exist.
Apache 2.0
298,860 tools. Last updated 2026-07-14 17:25
"Graph Visualization Tools for Nodes and Edges" matching MCP tools:
- Import datasets by bulk-creating nodes and edges from JSON arrays in a single call.Apache 2.0
- Identify disconnected subgraphs in the graph by finding connected components. Returns the number of components and the nodes in each.Apache 2.0
- Explore the BFS neighborhood around a graph node by ID or label, returning connected nodes and edges within a configurable depth limit (default 2, max 4).MIT
- Retrieve connected nodes and edges for a given node ID. Explore graph neighborhoods with options for direction, edge type, and limit.Apache 2.0
- Traverse the knowledge graph from a seed component to discover its connections to other app elements. Returns nodes and edges within a configurable depth budget, providing a read-only view of component dependencies.MIT
Matching MCP Servers
- Flicense-qualityDmaintenanceProvides tools for AI-powered graph analysis, including relationship extraction, adjacency matrix creation, and network centrality calculations. It enables users to perform complex structural analysis and generate interactive D3.js visualizations from structured data.Last updated
- Alicense-qualityBmaintenanceAn MCP server that gives your agent a persistent project brain: vision, architecture decisions, conventions, roadmaps, and automatic session handoff.Last updated157MIT
Matching MCP Connectors
The Graph MCP — indexed blockchain data via subgraph GraphQL queries
Free read-only AI coding verification tools: verification-debt calculator, task-spec lint, search.
- Match and retrieve knowledge graph nodes based on a text query against names, types, and observations.MIT
- Retrieve trust mesh graph data: nodes (entities and agents) and edges (reviews and favors). Optionally center on a slug for an ego-network view.MIT
- Retrieve connected nodes and edges from a graph network for a specified node or the currently selected node.MIT
- Retrieves matching nodes and snippets from a knowledge graph by combining lexical, dense, and graph signals into a ranked list.MIT
- Compare two commits to identify added, removed, or modified nodes and edges in the infrastructure graph.Apache 2.0
- Push explicit graph structure with node rows and edge proposals exactly as given. Use only when structured nodes/edges with ids and kinds are already available.MIT
- Retrieve the current threat model, including all nodes and edges, to analyze attack paths and infrastructure vulnerabilities.Apache 2.0
- Create interactive visualizations of network data using GPU-accelerated rendering for graphs and hypergraphs to reveal connections and patterns.MIT
- Retrieve InfraDB statistics including repository count, total nodes, edges, and storage usage.Apache 2.0
- Cross-check a symbol's graph caller edges against a regex text search to identify call sites missed by tree-sitter and flag likely false edges.MIT
- List typed edges from or into a node to explore dependencies, links, and tracked items in the knowledge graph.MIT
- Retrieve a dialog flow application canvas by ID to view its graph structure of nodes and edges for dialog management.MIT
- Retrieve all nodes and edges from the active canvas to inspect the current workflow.MIT
- Organizes graph nodes into clustered box layouts to visualize grouped network data clearly and improve analytical insights.MIT