This Unity project showcases A* pathfinding visualization. It uses a binary heap / priority queue for the open set and a hashset for the closed set, so it is "standard optimized". The implementation is fully single-threaded.