Can we run A* in less than 1ms in Unity?

In this video we will implement the A* Pathfinding algorithm in Unity. The performance becomes lightning fast when with the Burst Compiler. This algorithm can be directly used in game.

Links:
Download the final project on GitHub
https://github.com/Coderious-GitHub/A...
A* on Wikipedia
https://en.wikipedia.org/wiki/A*_sear...
Introduction to A* from Stanford University
http://theory.stanford.edu/~amitp/Gam...
A* on GeekForGeeks
https://www.geeksforgeeks.org/a-searc...

Timestamps
0:00 - Intro
0:38 - Theory
2:30 - Getting Started (new project and adding the Collections package)
3:55 - Code initialization (namespaces, variables)
5:42 - Preparing the interface
9:00 - A* algorithm
13:47 - Executing the job
16:07 - Clearing tiles
16:47 - Optimizations
17:50 - Outro
18:50 - ??

License and Attributions:
(intro/outro) The Road by Punk Rock Opera is licensed under a Attribution License.
(background music) L A T E N C Y by Mystery Mammal is licensed under a Attribution License.
https://creativecommons.org/licenses/...
(Intro break)
Magic by Six Umbrellas is licensed under a Attribution-ShareAlike License. (Intro-Outro: sample)
License: https://creativecommons.org/licenses/...