Graph Neighbors Node
Data/Database/Graph/Query
Finds neighbor nodes by traversing edges from a seed node
Ratings
Scores range from 0 to 10. Higher values mean more impact, exposure, or operational weight.
Input Pins
7Graph Connection
StructGraph connection reference
Node Label
StringLabel of the seed node
Node ID
StringID of the seed node
Depth
IntegerMaximum traversal depth (1-5)
Direction
StringTraversal direction: outgoing, incoming, or both
Limit
IntegerMaximum number of results
Output Pins
5Done
ExecutionTraversal completed
Error
ExecutionTraversal failed
Error Message
StringError details
Nodes
Struct ArrayDiscovered nodes
Only the seedless sampler knows population counts; every other path leaves this unset. `flow-like-catalog-core` mirrors this struct without the field, so a subgraph routed through that type loses the stats.
Population fan-out of one object, as seen through the sampling window.
False when the window did not cover the whole relationship table, which makes every count a lower bound.
Arrow field metadata for typed property previews.
Edges
Struct ArrayDiscovered edges
Arrow field metadata for typed property previews.
Node Info
- Internal name
- graph_neighbors
- Category
- Data/Database/Graph/Query