retrieve_with_traversal
Explore connected memory nodes from a starting point to analyze relationships and dependencies within a semantic graph, using depth limits and edge type filters.
Instructions
Start from a specific memory node and traverse the graph outward. Returns the starting node plus all reachable neighbors within the depth limit, scored by edge weight decay and depth penalty. Use after search_memory_graph to explore a specific node's neighborhood.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| start_node_id | Yes | ID of the memory node to start traversal from. | |
| max_depth | No | Maximum traversal depth from start node. Default: 2. | |
| edge_filter | No | Only traverse edges of these types. Omit for all. |