dykstras shortest path

[falkpl]

I am trying to take an array of XY clusters and cerate the shortest path through the points, I remember using dykstras back in grad school for something similar.  Has anyone implemented such an algorithm in labview?

Paul 

[NIquist]

There is actually an example (in LV7.1) called "shortest paths.vi" that uses the Bellman priciple.  That might get you started.

[falkpl]

Thanks I will look it over.

Paul

[DFGray]

I believe A* is probably the most efficient pathfinding algorithm.  I started to implement one and ended up with a depth-first algorithm.  However, the building blocks can be used for A* as well.  If you are interested, I can dig it up and post it.