What is the algorithm used behind AStarPathfinding?

In my special case, a regular A* would never bring such results in a such ridiculous amount of time. How could be described, or what is, the algorithm behind the basic point graph path finding used in the plugin?

Hi

It’s just A* really.
What makes you believe it is not A*?

Then it looks like an A* pumped up on steroid. I’m very impressed by its efficiency and that’s what I was wondering.

Well. Thank you for the kind words :slight_smile: