get_graph
Extract a sampled subgraph from a graph memory, filtering by node/edge types and sources, to visualize and trace the provenance of knowledge.
Instructions
Subgraph as {nodes, links, meta}. Filters are optional. Above limit nodes
the best-connected ones are kept (meta.sampled). Parallel links are merged
into one with a count; above max_links the heaviest are kept
(meta.links_truncated). Prefer search and neighbors over a wide get_graph.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| limit | No | ||
| sources | No | ||
| max_links | No | ||
| edge_types | No | ||
| node_types | No |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |