[Qgis-user] Distance matrix using shortest path (FH longest path and others)

[Falk Huettmann]

Dear Kind Colleagues,

thanks, I have a similar question, but with an opposite aim:

We have two points,
and want to connect them,
but then, NOT with the most direct and shortest path.
Rather, with the most meaningful and considerate one.
Like,
length is not to be penalized but other factors, habitats available, amount
of pixels
underneath etc.
Perhaps even showing different scenarios (aka, many paths lead to Rome...) ?
The path can consist of more than a line, an area connection let's say.

So in other words: the optimization is NOT done by short distance.

Would you have any ideas and suggestions on that ?

Thanks so much for any input
   Falk Huettmann






On Mon, Aug 26, 2019 at 2:07 AM Chintan Advani <chintanadvani at gmail.com>
wrote:

> Hi guys,
>
> I have a shape file with set of points on a road network. I am trying to
> find the shortest distance among these points using the shortest path tool.
> I have tried using the distance matrix tool in QGIS but it gives eucledian
> distance between these points whereas I am looking the path distance (based
> on road network). Can someone please suggest some tool or technique that
> can help me solve this problem?
>
> Thanks and Regards,
> __________________________________________
> Advani Chintan Sanjeev
>         Research Scholar,
>         Civil Engineering and Build Environment,
>         Queensland University of Technology,
>         Brisbane-4000, Australia.
> _______________________________________________
> Qgis-user mailing list
> Qgis-user at lists.osgeo.org
> List info: https://lists.osgeo.org/mailman/listinfo/qgis-user
> Unsubscribe: https://lists.osgeo.org/mailman/listinfo/qgis-user
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.osgeo.org/pipermail/qgis-user/attachments/20190826/07b96531/attachment.html>