From agentdb-graph
Execute Cypher queries against AgentDB's graph backend. Use when the user wants to write a custom traversal that the standard tools don't cover, or when explaining graph state.
How this skill is triggered — by the user, by Claude, or both
Slash command
/agentdb-graph:agentdb-cypherThe summary Claude sees in its skill listing — used to decide when to auto-load this skill
Run arbitrary Cypher against the AgentDB graph backend. The native binding accepts standard openCypher; AgentDB also adds a few extensions (`uplift`, `confidence` properties on edges).
Run arbitrary Cypher against the AgentDB graph backend. The native binding accepts standard openCypher; AgentDB also adds a few extensions (uplift, confidence properties on edges).
agentdb_causal_* tools don't coveragentdb_causal_query(
cypher: <query string>,
params?: { ... }
)
Returns: { rows, stats: { execMs, rowsMatched, rowsReturned } }
-- Top 10 most-cited skills
MATCH (s:Skill)<-[r:references]-(:Episode)
RETURN s.name, count(r) AS cites
ORDER BY cites DESC LIMIT 10
-- Find hub nodes (high in-degree)
MATCH (n)<-[r]-()
RETURN n.id, n.type, count(r) AS inDegree
ORDER BY inDegree DESC LIMIT 20
-- Walk supersedes chain backwards from current ADR
MATCH p=(current:ADR {id: 'ADR-046'})-[:supersedes*]->(ancestor:ADR)
RETURN [n IN nodes(p) | n.title]
-- Cycle detection (worth a warning)
MATCH p=(n)-[:caused*1..5]->(n)
RETURN p LIMIT 5
The agentdb_causal_query tool accepts arbitrary Cypher, including writes (CREATE, DELETE, DETACH DELETE). For destructive operations, prefer the typed delete tools (agentdb_causal_node_delete, agentdb_causal_edge_delete) — they enforce cascade semantics and write to the attestation log.
params to avoid Cypher injection.MATCH (n) DETACH DELETE n (deletes everything). Always scope the match.WHERE id IN [...] works — the binding's per-call overhead adds up.npx claudepluginhub ruvnet/agentdb --plugin agentdb-graphGenerates, optimizes, and validates Cypher 25 queries for Neo4j 2025.x+. Covers graph pattern matching, vector/fulltext search, subqueries, batch writes, and index usage.
K-hop traversal from a starting node in AgentDB's graph. Use to explore neighborhoods, find reachable nodes, or visualize a memory's "context".
Models graph structures in SQL tables with recursive CTEs for path queries, cycle detection, and multi-hop traversals. Useful for social graphs, dependency networks, and recommendation systems.