Dear All,
I've found a problem with the Network Topology - Shortest Path function and i'd like to know if anyone has seen it or found a solution for it.
Description:
- Made a very simple network topology, with two possible routes between two points as a start.
- Run the shortest path, with minimum resistance set lower than the shortest path's length, and the maximum set to more than that. Runs perfectly, no problem
- Now i wish to find the second shortest path. You enter a minimum resistance which is more than the resistance of the shortest path, but less than the second longest path's resistance,(maximum set to more than the longest path) and the program says there's no such path, which is obviously not true.
Have anybody tried this and suceeded?
Thx in advance, GG
hi i want to take shortest path algorithm in mapserver and with postGIS database and php
how can it
if you have information about it please help me in hosain.moh00@gmail.com
tank you .
Hi gabag, I recomend study this page http://workshop.pgrouting.org/index.html
Good Luck!
Hi I always looking for new posibilities for routing network, could you show how you create a network dataset in autocad?
Thanks a lot.
Hi Hahesa,
Useful link, thank you 🙂 I didn't post the Postgre question, but I'll look into it.
Can't find what you're looking for? Ask the community or share your knowledge.