comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » Least Cost Path using Dijkstra's Algorithm
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
Re: Least Cost Path using Dijkstra's Algorithm [message #73093 is a reply to message #72978] Fri, 22 October 2010 06:25 Go to previous messageGo to previous message
ben.bighair is currently offline  ben.bighair
Messages: 221
Registered: April 2007
Senior Member
On 10/22/10 8:15 AM, David Fanning wrote:
> 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.
>

Hi,

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!

Ben
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: Machine Specific Code
Next Topic: Re: Machine Specific Code

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Wed Oct 08 18:04:54 PDT 2025

Total time taken to generate the page: 0.00243 seconds