comp.lang.idl-pvwave archive: archive » Least Cost Path using Dijkstra's Algorithm

Home » Public Forums » archive » Least Cost Path using Dijkstra's Algorithm

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

Re: Least Cost Path using Dijkstra's Algorithm [message #73097 is a reply to message #72978]

Fri, 22 October 2010 05:15

David Fanning
Messages: 11724
Registered: August 2001

Senior Member

Bill writes:

> Hopefully, speed. Is there a reason why I shouldn't?
>
> Currently, this is something typically accomplished with a GIS
> package, such as ArcGIS. Hopefully, sometimes these processes are
> painfully slower than they need to be. I work with a colleague that
> did this in MatLab. I would like to go it with IDL, so I can
> integrate this into ArcGIS.

I think the chances of implementing this algorithm in
anything other than a "painfully slow" way in IDL
are slim and none. Too many necessary FOR loops, probably.

Cheers,

David

--
David Fanning, Ph.D.
Fanning Software Consulting, Inc.
Coyote's Guide to IDL Programming: http://www.dfanning.com/
Sepore ma de ni thui. ("Perhaps thou speakest truth.")

Report message to a moderator

[Message index]

		Least Cost Path using Dijkstra's Algorithm By: Bill[1] on Thu, 21 October 2010 06:03
		Re: Least Cost Path using Dijkstra's Algorithm By: David Fanning on Fri, 22 October 2010 06:31
		Re: Least Cost Path using Dijkstra's Algorithm By: ben.bighair on Fri, 22 October 2010 06:25
		Re: Least Cost Path using Dijkstra's Algorithm By: David Fanning on Fri, 22 October 2010 05:15
		Re: Least Cost Path using Dijkstra's Algorithm By: James[2] on Mon, 25 October 2010 17:19

Previous Topic:	Machine Specific Code
Next Topic:	Re: Machine Specific Code

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Sun Oct 12 22:18:03 PDT 2025

Total time taken to generate the page: 1.59761 seconds