axiom_graph_graph

axiom_graph.mcp.server.axiom_graph_graph(project_root, node_id='', direction='out', depth=1, max_results=40, node_ids=None, offset=0)

Traverse and render the edge graph for a node.

To find all callers or construction sites of a symbol, use direction="in" – this returns every node that calls or depends on the given node. The recommended pattern for a usage search is: axiom_graph_search(symbol_name) -> get the node ID from the results -> axiom_graph_graph(node_id, direction="in") to see callers, then follow with grep_search for literal call sites that may not be indexed.

Parameters:

project_root str

Absolute path to the indexed project.

node_id str

ID of the starting node.

direction str

"out" – nodes this node depends on. "in" – nodes that depend on / call this node. "both" – full neighbourhood.

depth int

Number of hops to traverse.

max_results int

Maximum number of edges to return (default 40). When the traversal exceeds this cap, output is truncated with a hint to narrow the query.

node_ids list[str] | None

Optional list of node IDs for batch operation. When provided, node_id is ignored and graph results are returned for all listed IDs with per-ID delimiters.

offset int

Number of edges to skip (default 0).

Return type:

str