hi, Shortest path c implementation , if Nodes ( x,y,z pos ) are specified. It should give the intermediate nodes from which it have to pass while going to Goal node.

Erm, what exactly is the question? [grin]

Assuming that you're asking for help on shortest path algorithms, and your nodes are static, I think the A* algorithm is the one you want. There's links at the end of the Wikipedia article.