a_star_algorithm 0.4.1 
a_star_algorithm: ^0.4.1 copied to clipboard
Published 9 months ago • 
rafaelbarbosatec.com
rafaelbarbosatec.comPackage that uses the A * algorithm to find a way to the destination through the barriers.
0.4.1 #
- Remove Recursive method.
0.4.0 #
- BREAK: Now uses
(int, int)instead of Point. Thanks spydon! - Flutter is no longer a dependency
0.3.2 #
- Some improvements. #8 Thanks Horned-Nonsense
0.3.1 #
- Performance improvements.
- BREAK: Now uses
Point<int>instead of Offset
0.3.0 #
- Adds
AStar.byFreeSpaces.
0.2.1 #
- Add util method
AStar.resumePath. This resume path like: [(1,2),(1,3),(1,4),(1,5)] = [(1,2),(1,5)]
0.2.0 #
- Fixes result list order
- Adds start and end Offset in the result.
0.1.1 #
- fix conditional to consider diagonal
0.1.0 #
- Adds param
withDiagonalto enable and disable diagonal.
0.0.5 #
- Improvements example.
- Fix crash when not found a path.
0.0.4 #
- return path empty if the and is a barrier.
- fix bug Offset inverted.
0.0.3 #
- Improvement in the algorithm implementation
0.0.2 #
- Fix return the shortest path
0.0.1 #
- First version
Metadata
22
likes
160
points
879
downloads
Publisher
Weekly Downloads
Metadata
Package that uses the A * algorithm to find a way to the destination through the barriers.
Repository (GitHub)
View/report issues
Topics
#astar #algorithm #pathfinding
Documentation
License
MIT (license)
