This function lets you walk the points connected to a point (separated by a single edge). To get a list of all connected points at once, use neighbours.
int neighbour(<geometry>geometry, int point_num, int neighbour_num)
When running in the context of a node (such as a wrangle SOP), this argument can be an integer representing the input number (starting at 0) to read the geometry from.
Alternatively, the argument can be a string specifying a geometry file (for example, a
.bgeo) to read from. When running inside Houdini, this can be an
The number of the point whose neighbours you want to find.
Which neighbour to find. The neighbours are in no particular order. Use neighbourcount to get the total number of connected points.
The point index of the neighbour of the point. The order is undefined, but will be consistent for consistent geometry. Returns
-1 if the
neighbournum is out of range for that point, or the point is out of range for that input, or the input doesn’t exist.