Traverse Graph
traverse_graphWalk the graph from a starting node, discovering connected knowledge.
Returns all nodes reachable within max_depth hops, with their distance from the start. Essential for exploring knowledge graphs — find related concepts, trace connections, discover clusters.
Example: Start from "Alan Turing", traverse outgoing relationships up to 3 hops deep: start_entity_type: "person" start_entity_id: "alan-turing-001" max_depth: 3 direction: "outgoing"
Supports filtering by relationship types and direction.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| limit | No | Max results (default: 100, max: 1000) | |
| direction | No | Direction: outgoing, incoming, or both (default: both) | |
| max_depth | No | Maximum traversal depth (default: 3, max: 10) | |
| project_id | Yes | Project ID (UUID) | |
| environment | No | Environment: staging or production (default: staging) | |
| start_entity_id | Yes | Entity ID of the starting node | |
| start_entity_type | Yes | Entity key of the starting node | |
| relationship_types | No | Filter by relationship types (UPPER_SNAKE_CASE). Omit for all types. |