astar_dart 2.4.5 
astar_dart: ^2.4.5 copied to clipboard
A pathfinder implementation in Dart. Efficiently finds shortest paths on grids, supporting barriers and weights. Manhattan, Euclidean, Hex
astar_dart #
Features A* pathfinder algorithm implementation.
Support for different types of movement or grids (e.g., Hex astar).
Packages Benchmarked #
Benchmark Results #
The benchmark was run, and the following average execution times were recorded: grid 32x32 with 60 barriers
| Implementation / Heuristic | Diagonal Movement | Average Run Time (us) | Notes |
|---|---|---|---|
| - Manhattan | no | 730.03 | |
| - Hex | Possible | 1233.96 | |
| - Euclidean | Possible | 1753.23 |
Metadata
4
likes
140
points
587
downloads
Publisher
unverified uploader
Weekly Downloads
Metadata
A pathfinder implementation in Dart. Efficiently finds shortest paths on grids, supporting barriers and weights. Manhattan, Euclidean, Hex
Repository (GitHub)
View/report issues
Topics
#astar #pathfinder #manhattan #euclidean #hex
License
MIT (license)
