Jump to content
  • Advertisement

Archived

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

psjie

regarding to data structure in A* algorithm

This topic is 5243 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
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
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!