Jump to content
  • Advertisement

uastar - Simple A* path finder in C

Recommended Posts

There are a bunch of path finding implementations online. But, to be honest, I wasn't much satisfied with  most of them, for one of these reasons:

  • Dynamic memory allocation in the middle of the algorithm
  • Algorithm that does too much (more than what is needed)
  • Too many files for just a single task

So I made this two-files (`uastar.c` and `uastar.h`) library: https://github.com/ferreiradaselva/uastar

No memory dynamic allocation. Straight to the point (the README.md explains how to use).

It's nothing biggie, but certainly useful.

Path finder at work:


I'm leaving this in announcements, because I probably won't add more features (it's pretty much done).

Edited by ferreiradaselva

Share this post

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

  • 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!