Shortest Path API / Algo

[houGenie]

Hi,

perhaps someone can help me. I am programming a plugin for softimage and I need a way to find the shortest path from a selection (source + destination polygon). Softimage does contain this functionality with the Alt Key. But I did not find any C++ Class or Command to do this from a script or C++. Is it even exposed in the API?
If not, what would be the best way to implement a shortest path functionality? I know this is a complex topic. There are several algorithms which can help (for example A* and so on). But perhaps there are some hints how the Softimage implementation works? Or some nice links for polygon selection specifically with an algorithm for normal polygon meshes (not planes ;-)).

Thank you in advance!

[houGenie]

Okay, I have looked for the A* algorithm. But the main point of it is to calculate the heuristic distance between two polygons on a mesh. This is simple on a plane but how would you do that for a complex polygon model? Any hints?

[Bravlin Pechatnik]

Its your lucky day man ))) The one guy spote your post. Another one share this shit. Feel free to use.

[houGenie]

Its your lucky day man ))) The one guy spote your post. Another one share this shit. Feel free to use.

Fantastic, thanks! It is the same implementation which I build in python. Interestingly it uses also the Euclidian distance for the hscore, which is surely wrong in many cases. I think in this cases the shortest path is not the shortest path. It would be interesting in which form it deviates from the XSI implementation. Where did you get this code from?

Thank you!