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

Least Cost Path using Dijkstra's Algorithm [message #72978]

Thu, 21 October 2010 06:03

Bill[1]
Messages: 2
Registered: October 2010

Junior Member

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.

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: Wed Oct 08 13:31:22 PDT 2025

Total time taken to generate the page: 0.00497 seconds