Proactively save what the user just said in their own words to Graph-MIND, including facts, preferences, plans, and decisions, so past context remains available for later recall.
AGPL 3.0
683,505 tools. Updated 2026-10-21 06:22
"Dgraph" matching MCP tools:
- Set, inspect, or share where your personal Graph-MIND memory lives: choose a synced folder or local Postgres for access across your own PCs.AGPL 3.0
- Publish and retrieve team project decisions, progress, and handover notes with teammates' AIs, so everyone knows what changed, what is blocked, and what remains.AGPL 3.0
- Maps a Luau function's nested protos into an IDA-style call graph, returning flattened parent/depth nodes to trace callees, spot deeply nested logic, and pick disassembly targets.MIT
- Retrieves relevant past conversations, facts, preferences, and decisions as a size-capped context packet so assistants can answer questions that depend on earlier work or discussion.AGPL 3.0
- Delete chosen memories from Graph-MIND across your PC and other devices. Search by topic, confirm masked matches, then remove only the selected items.AGPL 3.0Destructive
Matching MCP Servers
WhisperGraphofficial
AlicenseAqualityDmaintenanceSelf-hostable MCP server for WhisperGraph — a graph of 7.39B nodes / 39B edges mapping DNS, BGP, GeoIP, WHOIS, and threat intelligence. Six read-only tools (Cypher query + schema introspection + threat assessment), six resources, eight investigation prompts. stdio and Streamable HTTP transports.825 npm1Apache 2.0- AlicenseAqualityAmaintenanceGraph-MIND records every conversation you have with Claude Code, Codex and Claude Desktop, word for word, in a store on your own PC. When a question depends on the past, the model you are using calls Graph-MIND over MCP and gets back a few thousand tokens of the conversations that answer it.473,169 PyPI4AGPL 3.0
Matching MCP Connectors
Ledger of AI-agent money on Base: ranked agents, payments, detections, free checks before you pay
A2A Grocery — the agentic commerce hub for retail grocery, at its original address
- Inspect or list matched memories and conversation turns as structured rows—ids, fields, and ordered history for one entity—rather than ready-to-read context.AGPL 3.0
- Retrieve recorded code changes with diff excerpts, filtered by project, time range, file, symbol, or change kind to answer questions about when and where code changed.AGPL 3.0
- Fetch graph API capabilities from CodeLogic, returning label and relationship metadata when the graph tier is active, or explaining missing routes otherwise.Mozilla Public 2.0
- Trace the bounded path between two nodes in your architecture graph, revealing underlying code and data dependencies. Specify from and to nodes, with optional depth and scan controls.Mozilla Public 2.0
- Search the CodeLogic knowledge graph to retrieve code and data architecture dependencies. Use a text query or identity prefix, with optional scan space and view filters.Mozilla Public 2.0
- Map C# control flow for a symbol or source location and return a bounded graph with operation metadata and exact source pointers.MIT
- Find owners and reviewers for any node in your code architecture graph by providing its node ID or identity prefix.Mozilla Public 2.0
- Query and visualize the thought graph to view DAG structure, find paths between nodes, inspect branches, and analyze graph statistics for structured reasoning.MIT
- Map dependencies in C# solutions, projects, documents, or project sets at chosen granularity, with node and edge limits for reviewable results.MIT
- Identify affected code and data dependencies from seed node IDs, using direction, depth, and scan space to bound the impact analysis.Mozilla Public 2.0
- Validate change scope safety by analyzing seed graph nodes and proposed change summary, preventing unintended dependency breaks.Mozilla Public 2.0
- Open an interactive force-directed schema graph to explore Microsoft Graph entities, permissions, and roles. Use entity, permission, or role views to focus on a node, search, expand, and pivot.MIT
- Identify conflicting facts in your memory graph by detecting pairs connected by a CONTRADICTS edge. Use during reviews or before graph decay to surface unresolved contradictions.MIT
- Split a falsely merged entity into two, moving specified edges to the new entity. Use when entity resolution incorrectly merged distinct entities.MITDestructive
- Assess graph health with counts of nodes, edges, orphans, contradictions, stale entries, schema version, and backlog. Use at session start or after graph decay/prune to verify results.MIT