You''re right, Dijkstra''s can be used easily with distance based path-finding. Distance and crossed paths however is inherent in A*, it''s a necessary part of the algorithm.

I just found it easier to implement an irregular grid in my A* code than a standard length or breadth first search.


---Strange

I read up on the Dijkstra algorithm in a maths book (I do this sort of thing in maths) - and it''s entirely distance related, I looked at Dijkstra''s algorithm on several computer science pages and they really really overcomplicate thing - I couldn''t understand them at all, but within 15 minutes reading my maths book I could do the algoithm off the top of my head...

Jack;

PS - Thanks for the URL..