graph_path
graph_pathFind the shortest typed path between two code entities, using explicit edges and opt-in heuristic edges.
Instructions
Graph tool for connection questions: find one shortest typed path between two entities while keeping heuristic edges explicit and opt-in.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"startEntity": "<startEntity>",
"targetEntity": "<targetEntity>"
},
"name": "graph_path"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| direction | No | ||
| edgeKinds | No | ||
| nodeKinds | No | ||
| projectId | No | ||
| projectRef | No | ||
| startEntity | Yes | ||
| targetEntity | Yes | ||
| traversalDepth | No | ||
| includeHeuristicEdges | No |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| _hints | Yes | ||
| result | Yes | ||
| toolName | Yes | ||
| projectId | Yes |