Retrieve nodes from a graph by distance.

Input parameters:

1. Gf → Graph to examine.
2. Pt → Point for nearest node search.
3. Gr → Number of nearest points to include in the results.
4. Rd → Optional search radius limits around point.

Output parameters:

1. Ns → Indices of nearest nodes.
2. Ds → Distances from the point to each nearest node.