Can anyone tell me what algorithm is used for the v.net.path shortest
path in GRASS?
Also for the iso and travelling salesman?
I am interested in the properties of these algorithms as the data sets
grow much larger.
Thanks in advance!
-Robin Chauhan
http://pirg.uwaterloo.ca/~robin