memo_graph
Query an entity knowledge graph to find shortest paths, explain connections via weighted edges, explore neighbors, or discover communities. Supports both memory-only and code-structure navigation.
Instructions
Navigate the entity knowledge graph (read-only).
One consolidated explorer over memo's corpus graph. Pick a verb:
"path": shortest entity path fromatob(fewest hops)."why": weighted shortest patha->bas evidence — the same route with each hop's edge weight (how many memories bridge it), so a connection is explained, not just asserted."neighbors": direct neighbours ofentity(ora)."explore": a rich "what's around X" view ofentity(ora) — degree, neighbours, and the memories that mention it."communities": clusters of related entities (limitcaps count).
By default this navigates the MEMORY graph only (entities linked through
shared memories). Set include_code=True to also fold in the codegraph
code-structure layer (call/extends/etc. edges between code symbols).
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| a | No | First entity (path/why source; fallback for entity). | |
| b | No | Second entity (path/why target). | |
| verb | Yes | One of path | neighbors | explore | communities | why. | |
| limit | No | Result cap (neighbours, mentioning memories, communities). | |
| entity | No | Entity name for neighbors/explore. | |
| include_code | No | Fold in the codegraph code-structure layer (default off → memory-only, so results are durable-memory navigation). |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||