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 #73092 is a reply to message #72978]

Fri, 22 October 2010 06:31

David Fanning
Messages: 11724
Registered: August 2001

Senior Member

Ben Tupper writes:

> I don't want to be contrary, but I wouldn't be too quick to dismiss IDL
> in general regarding the algorithm. It isn't that hard to code up the
> necessary search and nodes. IDL might do just fine.
>
> But the size of the specific problem looks pretty daunting. I'm still on
> the early side of my coffee, but a 20000 x 20000 single precision array
> is about 1.6 GB isn't it? Yikes!

Alright, if Ben is writing the program I'll up the
odds to thin and none. ;-)

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: Fri Oct 10 16:29:10 PDT 2025

Total time taken to generate the page: 0.16001 seconds