Walk the graph outward

neighborhood

Walk the graph outward from one object and get the subgraph back in a single call.

read

This is the tool to reach for rather than read. Reading an object and then each of its neighbours costs a round trip per object and the latency swamps the data: two hops through read is about fifteen calls, and this is one.

Returns nodes with the hop distance each was found at, and the edges between them. Watch redactedCount: it is how many neighbours permissions hid, so a subgraph with holes must not be read as proof that two things are unconnected.