Skip to main content
The current graph MCP server exposes ten tools. Connect it with the MCP setup guide. Every tool also accepts an optional project_path: an absolute path to a project directory containing graphify-out/graph.json. Omit it to use the graph selected when the server started. Access is subject to the server’s path controls. These schemas were extracted from the audited graphify/serve.py source. Graph exploration returns saved evidence. PR tools additionally use GitHub context; MCP triage returns data for your assistant to reason over.

query_graph

Search the knowledge graph using BFS or DFS. Returns relevant nodes and edges as text context.

get_node

Get full details for a specific node by label or ID.

get_neighbors

Get all direct neighbors of a node with edge details.

get_community

Get all nodes in a community by community ID.

god_nodes

Return the most connected nodes - the core abstractions of the knowledge graph.

graph_stats

Return summary statistics: node count, edge count, communities, confidence breakdown. No required inputs. Call with {} for the default graph.

shortest_path

Find the shortest path between two concepts in the knowledge graph. Follows stored edge direction by default; set undirected=true to ignore it.

list_prs

List open GitHub PRs with CI status, review state, and graph impact (which communities each PR touches, blast radius). Use this before starting work to check if a PR already covers the area you’re about to change.

get_pr_impact

Get detailed graph impact for a specific PR: which files it changes, which knowledge-graph communities are affected, and how many nodes are touched. Use this to assess merge risk or check for overlap with your current work.

triage_prs

Return all actionable open PRs (correct base, not stale) with full graph impact data so you can reason about review priority, merge order, and conflict risk. Call this when the user asks ‘what PRs should I review?’ or ‘what’s ready to merge?‘

Example calls

query_graph
shortest_path
The second example uses the tutorial project. Replace labels with nodes from your graph. A returned path is source-level context, not proof of runtime execution.