pysal.explore.spaghetti.
dijkstra
(ntw, cost, v0, n=inf)[源代码]¶计算起点节点和起点-终点矩阵中所有其他节点之间的最短路径。
参数: |
|
---|---|
返回: |
|
笔记
基于 [Dij59] .
实例
>>> import pysal.explore.spaghetti as spgh
>>> from pysal.lib import examples
>>> ntw = spgh.Network(examples.get_path('streets.shp'))
>>> distance, pred = spgh.util.dijkstra(ntw, ntw.edge_lengths, 0)
>>> round(distance[196], 4)
5505.6682
>>> pred[196]
133