• Advertisement

Archived

This topic is now archived and is closed to further replies.

regarding to data structure in A* algorithm

This topic is 5061 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Hi, i want to create a programme to track down the speed of A* pathfinding. do anyone suggest on using which data structure? do you have any recommend for the best tutorial on site for this? thank you! have a nice day! regards Best Regards, from psjie

Share this post


Link to post
Share on other sites
Advertisement
I''m not exactly sure what you''re asking, but Amit''s A* Pages has a pretty good description of the benefits of different data structures for A* implementations.

Share this post


Link to post
Share on other sites
A lot. Off the top of my head there''s also Bellman-Ford, depth first, breadth first, BEAM, IDA*, D*, LPA* and bidirectional search. Some of these are variations on each other, but all are recoginized as distinct algorithms.

Share this post


Link to post
Share on other sites

  • Advertisement