Ultimate A* Pathfinding Solution

Usage:

Pathfinder<T>() mypathfinder= new Pathfinder<Vector3>(HeuristicDistance, ConnectedNodesAndStepCosts,calculatorPatience);

mypathfinder.GenerateAstarPath( A, B, out path);

T: Any class or struct that has a way to measure distance between its instances. Examples are; Vector3, Vector2, Vector3Int etc. It can even be a custom class as long as there is a measurable distance between its instances.

HeuristicDistance: any method name that takes two T instances and returns an aproximate distance

ConnectedNodesAndStepCosts: any method name that takes a T instance and returns a dictionary of its neighbours as the keys and distances to the neighbours as the values.

calculatorPatience: the number of steps that the algorithm calculate before giving up. It is a safety precaution for testing. I advise starting with 100 or less and increasing to 9999 or more after testing.

GenerateAstarPath: returns true if exists a path from starting instance to ending instance, and outputs a list of adjacently connected T instances that lead to the target (path).