Generate a JSON methodology graph for custom visualization, with nodes for domains, concepts, memories, entities and edges for semantic links. Capped at 200 nodes and 500 edges.
MIT
521,507 tools. Updated 2026-09-06 11:42
"Graph Visualization Tools for Nodes and Edges" matching MCP tools:
- Retrieve the link graph for a folder or entire vault to visualize note relationships as nodes and edges.MIT
- Retrieve knowledge graph structure as nodes and edges for visualization. Output in JSON or stats format.MIT
- Export the memory network as a knowledge-graph edge list, including nodes and deduplicated undirected edges, for external visualization of semantic connections.MIT
- Remove a node permanently from the graph. Optionally delete all connected edges simultaneously, or fail if edges exist.Apache 2.0
- Check whether a project is indexed by viewing counts of files, symbols, dependency edges, and index.db size. Zero counts signal that indexing must run before graph tools return results.MIT
Matching MCP Servers
- FlicenseNot gradedqualityDmaintenanceProvides 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.-
- AlicenseNot gradedqualityCmaintenanceEnables querying a TypeScript codebase's graph for call flows, type relationships, and symbol locations without reading file bodies.-
Matching MCP Connectors
Decision Layer for AI Agents — 58+ tools, Advisor, MCP. Free key: POST /v1/register {}.
Read-only WooCommerce checkout and revenue incident diagnosis using privacy-safe store signals and public release evidence.
- 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
- Retrieve connected nodes and edges for a given node ID. Explore graph neighborhoods with options for direction, edge type, and limit.Apache 2.0
- Build editable RayTK ROP expression graphs from presets or custom nodes/edges, wiring typed connectors and exposing the output through out1 for immediate use in TouchDesigner.MIT
- Insert new nodes between two connected nodes in a visual workflow. Removes the existing connection and creates sequential edges through the inserted nodes.-
- 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
- Read an entity's graph neighborhood to retrieve nodes, typed edges, canonical facts, and derived relationships, helping explore persistent long-term memory across sessions.Apache 2.0
- Restore the last undone change in Circuitry's visual workflow platform, bringing back nodes, edges, and drawing data to their next state.-
- Create visual flowcharts with nodes and edges to map processes, decisions, and workflows for clear documentation and analysis.-
- Generate a price-correlation graph of stocks, centered on a chosen symbol or from top trending tickers, with edges above a minimum correlation.MIT
- Get a transaction's graph structure for visualization and relationship analysis. Input protocol and hash to receive detailed transaction data.AGPL 3.0
- 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 a file's graph of imports, declarations, intra-file calls, and cross-file stubs to navigate code structure.AGPL 3.0