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

Home » Public Forums » archive » Re: 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 #72977]

Thu, 21 October 2010 06:24

David Fanning
Messages: 11724
Registered: August 2001

Senior Member

Bill writes:

> I would like to take a raster, which represents the "cost" of moving
> through that pixel, and find the shortest path (i.e. least cost path)
> through that raster. For example, using geospatial analysis and
> several layers of data, this can often be used to model cross country
> mobility with each raster cell represent the ease or difficulty of
> moving through that cell.
>
> Has any written an IDL program that does a least cost path from a
> starting cell to an ending cell using Dijkstra's Algorithm?
> http://en.wikipedia.org/wiki/Dijkstra's_algorithm
>
> It's a simple concept but can be very memory intensive depending on
> the size of your raster, in my case could easily be 20,000 samples by
> 20,000 lines.
>
> Thanks for your help. I am new to IDL so was looking for a jump start.

And you are choosing IDL to do this for what reason?

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]

		Re: Least Cost Path using Dijkstra's Algorithm By: David Fanning on Thu, 21 October 2010 06:24
		Re: Least Cost Path using Dijkstra's Algorithm By: Bill[1] on Fri, 22 October 2010 03:38

Previous Topic:	What's HISTOGRAM doing now?
Next Topic:	Good programming practices and commercial development with IDL

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Wed Oct 08 15:33:10 PDT 2025

Total time taken to generate the page: 0.00492 seconds