擅长:python、mysql、java
<p>如果要计算两个位置之间的距离(一个接一个,如^{<cd2>所示)并向前看,可以尝试如下<code>range</code>。在</p>
<pre><code>from haversine import haversine
d = [(52.472665, -1.8977818),
(52.47455886, -1.90080653),
(52.4515712, -1.9327772),
(52.45028622, -1.93212766),(53.45028622, -1.93212766)]
data = []
for i in range(len(d)-1):
data.append(haversine(d[i], d[i+1], miles=True))
print data
</code></pre>
<p>输出-</p>
^{pr2}$
<p><strong>编辑</strong>-
如果您想获得<code>d</code>中所有组合(所有可能的非重复位置对)之间的距离,则-</p>
<pre><code>from haversine import haversine
from itertools import combinations
d = [(52.472665, -1.8977818),
(52.47455886, -1.90080653),
(52.4515712, -1.9327772),
(52.45028622, -1.93212766),(52.45028622, -1.93212766)]
data = []
for pair in combinations(d,2):
data.append(haversine(pair[0], pair[1], miles=True))
print data
</code></pre>
<p>输出-</p>
<pre><code>[0.18255943050822185, 2.072320708393457, 2.1169388238266245, 2.1169388238266245, 2.0818287457607068, 2.1333352954019116, 2.1333352954019116, 0.09290096620460978, 0.09290096620460978, 0.0]
</code></pre>