[vtkusers] Shortest route algorithms?

Etienne Labuschagne ELabuschagne at gims.com
Thu Sep 19 04:18:30 EDT 2002

Hi there,

If I have a structured grid containing a cost for each cell, what's the best
way to determine the least cost route from one cell to another.

I am thinking along the lines of using Dijkstra's algorithm but if there is
already something available that is implemented for VTK, I would of course
be glad to use that!

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.vtk.org/pipermail/vtkusers/attachments/20020919/6c135bab/attachment.htm>

More information about the vtkusers mailing list