This question was asked many times and I could reference endless GIS-SE links here. Most of them suggest using pgRouting, which is not an option here. I have to use QGIS (for other technical questions). Others suggest QNEAT3 plugin, which is not working as expected (see here).
So I'm looking for a definitive answer, which can be referenced forever here and put an end to new ones (and, of course, put an end to my recurrent problem). I know it is possible to have a purely QGIS-based answer, as pointed out in the documentation. With my somewhat superficial python knowledge, I can't do it myself, but I know it's possible.
I have three layers:
mpoints in a map layer
npoints in a map layer
karcs/paths/lines in a map layer
I need a distance matrix of shortest paths from all
m points to all
n points through that network.
Almost a solution
The Shortest path (point to layer) tool is the closest solution you can readily have. Except by the fact you have to manually input the
from coordinates picking it from the map. This can be really painful if you have 100+
from origins to calculate.
Easiest solution I can foresee
- use the Shortest path (point to layer, dijkstra method) tool iterating through all records of the
originsmap layer getting its coordinates and processing it in a loop.
Some test datasets
The problem is how? I'm relatively new to QGIS and I'm not sure how to build a model or modify the native tools. Any insights are much appreciated!