[vtkusers] Shortest route algorithms?
ELabuschagne at gims.com
Thu Sep 19 04:18:30 EDT 2002
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...
More information about the vtkusers