Take the 2-minute tour ×
Geographic Information Systems Stack Exchange is a question and answer site for cartographers, geographers and GIS professionals. It's 100% free, no registration required.

I have used this great tutorial, and shortest part between two points works fine. My question is: How to calculate shortest path between multiple points?

Thanks, Marko

share|improve this question
1  
Could you elaborate on your question. It's not clear what exactly you are looking for. Best include a sketch. –  underdark Sep 13 '12 at 13:48
1  
Check out this question that I asked before if it's any good to you –  dassouki Sep 13 '12 at 14:06
add comment

2 Answers 2

there is a modified shortest_path which enables multiple destinations;

Take a look at https://github.com/pgRouting/pgrouting/wiki/One_to_many-Dijkstra---To-review or the forked pgrouting https://github.com/HSylvio/pgrouting

Hope it works as well for you as it does for me!

share|improve this answer
add comment

Assuming you have multiple start points and a single finish point, another approach may be using Cost Path command in Raster Calculator as follows:

CostPath("Inicial_points","Costs","Direction")

Comparing paths with rivers, we can use "Inicial_points" = Headwaters, "Costs" = Digital Elevation Model and "Direction" = Flow Direction.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.