pysal.explore.spaghetti.
generatetree
(pred)[源代码]¶重建从根原点到目标的最短路径
参数: |
|
---|---|
返回: |
|
实例
>>> 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)
>>> tree = spgh.util.generatetree(pred)
>>> tree[3]
[23, 22, 20, 19, 170, 2, 0]