shortest path

Hi all, I'm a very new grass user. Does anybody know if a program exists to
figure out shortest paths on vector layers? I mean: a Dijkstra algorithm
or similars? If not, would it be useful if I developed such a program?

Thanks. Roberto.

Roberto Micarelli wrote:

Hi all, I'm a very new grass user. Does anybody know if a program exists to
figure out shortest paths on vector layers? I mean: a Dijkstra algorithm
or similars? If not, would it be useful if I developed such a program?

Thanks. Roberto.

It would be useful.

Radim

Angus Carr wrote:

I, too, have thought that this would be a useful program. The network has
topology, so you should be able to do something with it. A feature request
for you- please allow the reporting of the nodes/segments taken. I want to
do a traffic analysis, and I need a log of all vehicles that pass through
any given node, and along any given vector, assuming they took the shortest
path from point to point. Given the list of nodes and edges between any two
points (Dijkstra), I can then do the traffic analysis.

One other possibility for you is to develop a network API and library for
GRASS. That way, others can easily build on your work. It makes the
development of your code quite modular, too, which is always a good thing.

Thanks for the idea, and I will be happy to help with testing when it comes
time. If you want other help, I can provide some, as needed.

Angus Carr.

Thanks to you for the help. I agree with your suggestions. We can switch to the
developer list or private mail for details.

Ciao.