Graph Query
graph_queryRetrieve nodes and connecting edges from a memory graph by canonical entity name, with traversal depth, weights, and provenance. Use when you know the exact or close entity name.
Instructions
Query the memory graph by canonical entity name. Use when you know the entity name or close-to-canonical form (e.g. "Steve", "graph-memory"); for natural-language phrasing or synonyms (e.g. "the knowledge graph project") prefer graph_search. Returns up to limit matching nodes plus the edges that connect them within max_hops, with per-edge weight and source provenance.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| limit | No | Max results (default: 20) | |
| entities | Yes | Entity names to search for | |
| max_hops | No | Max traversal depth (default: 2, capped at 4) | |
| min_weight | No | Min edge weight to traverse (default: 0.3) | |
| current_only | No | Only current facts, exclude superseded (default: true) | |
| entity_types | No | Filter results to these entity types | |
| context_level | No | Response detail level (default: full) | full |
| project_context | No | Project directory or name for affinity scoring |