sharpetronics/QGIS
1
0
Fork 0
mirror of https://github.com/qgis/QGIS.git synced 2025-04-17 00:04:02 -04:00
Code Issues Packages Projects Releases Wiki Activity

[processing] add cancellation support where possible

Browse Source
This commit is contained in:
Alexander Bruy 2017-07-16 11:52:52 +03:00
parent 5af177e963
commit 95de3a414a
2 changed files with 6 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
python/plugins/processing/algs/qgis/ShortestPathLayerToPoint.py
View File

@ -237,6 +237,9 @@ class ShortestPathLayerToPoint(QgisAlgorithm):
total = 100.0 / source.featureCount() if source.featureCount() else 1 total = 100.0 / source.featureCount() if source.featureCount() else 1
for i in range(1, count + 1): for i in range(1, count + 1):
if feedback.isCanceled():
break
idxStart = graph.findVertex(snappedPoints[i]) idxStart = graph.findVertex(snappedPoints[i])
tree, cost = QgsGraphAnalyzer.dijkstra(graph, idxStart, 0) tree, cost = QgsGraphAnalyzer.dijkstra(graph, idxStart, 0)

3
python/plugins/processing/algs/qgis/ShortestPathPointToLayer.py
View File

@ -238,6 +238,9 @@ class ShortestPathPointToLayer(QgisAlgorithm):
total = 100.0 / source.featureCount() if source.featureCount() else 1 total = 100.0 / source.featureCount() if source.featureCount() else 1
for i in range(1, count + 1): for i in range(1, count + 1):
if feedback.isCanceled():
break
idxEnd = graph.findVertex(snappedPoints[i]) idxEnd = graph.findVertex(snappedPoints[i])
if tree[idxEnd] == -1: if tree[idxEnd] == -1: