擅长:python、mysql、java
<p>方法是创建一个1000 x 25000的矩阵,然后找到行最小值的索引。你知道吗</p>
<pre><code># distances for all combinations (1000x25000 matrix)
dum_arr = (point_x[:, None] - compare_x)**2 + (point_y[:, None] - compare_y)**2
# indices of minimums along rows
idx = np.argmin(dum_arr, axis=1)
# Not sure what is needed from the indices, this get the values
# from `point_name` dataframe using found indices
min_vals = df_compare['point_name'].iloc[idx]
</code></pre>