You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In the current state, you'll need to do some post-processing to get the k nearest neighbors: sorting the distances array; sorting the (i, j, S) arrays in the same way; and then taking the first k elements.
It could make sense to add an option on vesin side to do the sorting according to distances (the current sorted argument sorts the pair indices); and then you would only have to slice the arrays to get the data you need.
Can vesin find k nearest neighbors within r_cutoff and output idx_i, idx_j, shifts? For now I can only calculate all neighbors within r_cutoff.
The text was updated successfully, but these errors were encountered: