cos_graph_path
Trace the shortest route between two UIDs in a knowledge graph, with an optional hop limit.
Instructions
Shortest path between two nodes (either direction).
Args:
source_uid: Origin uid (auto-resolves raw paths; see
cos_graph_impact for the scheme).
target_uid: Destination uid (same rules as source_uid).
max_hops: BFS depth limit (default 5).
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| max_hops | No | ||
| source_uid | Yes | ||
| target_uid | Yes |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |