search_memory_graph
Search a semantic memory graph using natural language queries to find relevant information and discover connected context through graph traversal.
Instructions
Search the memory graph by meaning with graph traversal. First finds direct matches via embedding similarity, then traverses 1st/2nd-degree neighbors to discover linked context. Returns both direct hits and graph-connected neighbors with relevance scores.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| query | Yes | Natural language query to search the memory graph. | |
| max_depth | No | How many hops to traverse from direct matches. Default: 1. | |
| top_k | No | Number of direct matches to return. Default: 5. | |
| edge_filter | No | Only traverse edges of these types. Omit for all types. |