CATE needs your help ...

[Skyfire76]

Thanks for the answers, Julian.

I'll look at your links and see if I can work out something with this.

However, I have the felling that this is more or less what I already did with my A* algorithm. And I've come to the conclusion (maybe I'm wrong ...) that the only way I have to come up with something not so bad is to check ALL paths (with a cost for each one, so I can choose the best).

I'll see if this is doable with the above links.

Will keep you informed.

Regards.

[codec]

Thats basically what the minimum spanning does - check all paths. But it heads for the shortest path first so will find it the quickest way.

Julian.