Hi, Yes. You will need the QGIS network tools in processing or install a network plugin. Look in the plugins under network. You are will want to make a shortest Path Djikstra using “one to all” on a weighted directed graph. Google “Nicolas Cadieux and “ A Python Algorithm for Shortest-Path River Network Distance Calculations Considering River Flow Direction” in Data. That article will give you some hints on how to prepare the network.
Nicolas Cadieux Ça va bien aller! >> Le 28 juill. 2020 à 05:45, Aki Meinander <[email protected]> a >> écrit : > > Hey. > > I have a few problems. > > 1. If I put GPS points (WGS or KKJ) on the map (OpenStreetMap), they will > throw 3000 km. > > 2. How can the driving time be calculated from point a to points 1-2000? is > it possible? In other words, to multiple destinations from the same starting > point. Or alternatively the length of the trip. > > > Thanks if anyone can help me. > -aki > > > _______________________________________________ > Qgis-user mailing list > [email protected] > List info: https://lists.osgeo.org/mailman/listinfo/qgis-user > Unsubscribe: https://lists.osgeo.org/mailman/listinfo/qgis-user
_______________________________________________ Qgis-user mailing list [email protected] List info: https://lists.osgeo.org/mailman/listinfo/qgis-user Unsubscribe: https://lists.osgeo.org/mailman/listinfo/qgis-user
