Least-Cost-Paths Network
Plugin ID: 1357
Compute the network of Least-Cost Paths between multiple origins and destinations based on a cost surface map
(30) votes
Download latest
This plugin has an experimental version available!
LCPNetwork applies Dijkstra's algorithm to get optimal paths between a the features of 2 point vector layers. You will also need to specify a raster map of costs such as slope or a prominence index. The plugin will generate an accumulated cost map for each of the points and a line vector layer with all the optimal paths which can be used for further analysis. The current version will freeze the UI until the algorithm finishes. Computing time can be very large for high-resolution cost surface maps.
| Version | QGIS >= | QGIS <= | Date | |||
|---|---|---|---|---|---|---|
| 0.1.5 | 3.0.0 | 3.99.0 | 4155 | xrubio | 2019-08-28T10:07:38.026902+00:00 | |
| 0.1.4 | 2.0.0 | 2.99.0 | 1134 | xrubio | 2018-12-11T10:07:11.712449+00:00 | |
| 0.1.3 | 2.0.0 | 2.99.0 | 400 | xrubio | 2018-12-05T17:51:32.502259+00:00 | |
| 0.1.2 | 2.0.0 | 2.99.0 | 844 | xrubio | 2018-10-31T13:27:54.987527+00:00 | |
| 0.1.1 | 2.0.0 | 2.99.0 | 1671 | xrubio | 2017-10-31T17:54:04.817981+00:00 |
