kremis_traverse
Traverse a knowledge graph from a starting node to discover connected entities. Control depth and optionally limit to highest-weight edges.
Instructions
Traverse the graph from a node to discover connected entities
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| node_id | Yes | The starting node ID | |
| depth | No | Traversal depth (default: 2, max: 10) | |
| top_k | No | Return only the K highest-weight edges (optional) |