Graph Path (bounded relationship-path finder between two people/companies — warm-intro / degrees-of-separation) [beta]
graph_pathFind the relationship path(s) between two people (or a person and a company) — the 'Paths In' / Find-Path / warm-intro-meter primitive. Bounded BFS over the person↔person connected_to graph (professional/board/deal co-occurrence ties), depth ≤ max_hops (default 3). Returns the shortest paths as node sequences with the per-hop tie strength and an overall score (strength_product = product of ties, favors short strong paths; strength_min = weakest link).
from_id + to_id are graph_resolve node UUIDs. If to_id is a company, the final hop is a leadership edge (board member / officer / employee) into it, so a path reads person →connected_to→ person →board_member→ company. Top-level connected + min_hops are the warm-path meter ('reachable via N hops'). Bidirectional beam search — bounded, returns strong short paths (not every possible path). to_type optional (inferred).
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"from_id": "<from_id>",
"to_id": "<to_id>"
},
"name": "graph_path"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to_id | Yes | Target node UUID — a person or a company (graph_resolve). | |
| from_id | Yes | Source PERSON node UUID (graph_resolve). | |
| to_type | No | Optional — target type; inferred if omitted. | |
| max_hops | No | Max path length in edges (default 3, max 4). 2-3 is the useful range. | |
| top_paths | No | How many best paths to return (default 5, max 25). |