python两点之间最短距离_求两点间的最短距离Python

使用BallTree from Sklearn，它提供了一种更快的查找最近邻居的方法import numpy as np

import pandas as pd

from sklearn.neighbors import KDTree, BallTree

properties=pd.DataFrame({'propertyID':['13425','32535','43255','52521'],

'lat':[-37.79230,-37.86400,-37.85450,-37.71870],

'lon':[145.10290,145.09720,145.02190,144.94330]})

stations=pd.DataFrame({'stationID':['11','33','21','34','22'],

'lat':[-37.416861,-37.703293,-37.729261,-37.777764,-37.579206],

'lon':[145.005372,144.572524,144.650631,144.772304,144.728165]})

property_coords = properties.as_matrix(columns=['lat', 'lon'])

station_coords = stations.as_matrix(columns=['lat', 'lon'])

# Create BallTree using station coordinates and specify distance met