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
692,020 tools. Updated 2026-10-23 16:32
"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
- 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
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 gradedqualityBmaintenanceEnables generation of 11 chart types — including A-share K-line, decision tree, combo and waterfall — from JSON data, with automatic CJK font detection and light/dark themes.MIT
Matching MCP Connectors
Decision Layer for AI Agents — 58+ tools, Advisor, MCP. Free key: POST /v1/register {}.
Check a plot document and get a link that opens it in Graph Paper. No account, no key.
- Retrieve connected nodes and edges for a given node ID. Explore graph neighborhoods with options for direction, edge type, and limit.Apache 2.0
- 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
- Delete multiple edges (relationships) from a TigerGraph graph in one bulk operation. Removes specified connections permanently without deleting vertices.Apache 2.0Destructive
- Retrieve the ruleset-map graph for a published ruleset or composed rulebook to visualize and explain how branches compose, with nodes, edges, sections, stats, and a Mermaid diagram.MIT
- Retrieve a knowledge graph of notes, including wikilink edges and semantic similarity connections. Scope by folder or note neighborhood to explore relationships and identify unresolved links.AGPL 3.0
- Create a visual diagram from nodes and edges and save it into an existing CanvasKeep diagram; automatic layout handles positioning.MIT
- Retrieve connected nodes and edges from a graph network for a specified node or the currently selected node.MIT
- Build a complete flowchart or graph in one call. Nodes are laid out in layers and wired with connectors, preventing overlapping shapes.MIT
- Generate a price-correlation graph of stocks, centered on a chosen symbol or from top trending tickers, with edges above a minimum correlation.MIT
- End the current knowledge-graph session while preserving nodes and edges; start a new session before further writes.Apache 2.0
- Get a transaction's graph structure for visualization and relationship analysis. Input protocol and hash to receive detailed transaction data.AGPL 3.0
- Fetch multiple graph edges from TigerGraph, with optional filtering by edge type or source vertex to explore relationships and support data analysis.Apache 2.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