### Summary * Replaces the node chain with a PriorityQueue. * Performance difference is up to 3x faster. ### Benchmarks ```cs | Method | Mean | Error | StdDev | Gen0 | Allocated | |-------------------- |---------:|----------:|----------:|-------:|----------:| | FastAStar_PQueue | 2.112 us | 0.0186 us | 0.0165 us | 0.0038 | 64 B | | FastAStar_NodeChain | 6.430 us | 0.0800 us | 0.1807 us | - | 64 B | ``` ### Video https://github.com/user-attachments/assets/3edd2524-5146-4775-be45-3516f0b01c27 |
||
|---|---|---|
| .. | ||
| FastAStarAlgorithm.cs | ||
| Movement.cs | ||
| MovementPath.cs | ||
| MoveResult.cs | ||
| PathAlgorithm.cs | ||
| PathFollower.cs | ||