- Exposed a
Grid::set
method to allow modifying the state of a node at a given position.
- Rewrote core algorithm to avoid unnecessary heap allocations, boxed references in
Node
s, and better backing data structures for node sets. In general, the performance improvements were multiple orders of magnitude faster - particularly on larger grids. - Modified
Grid
to use aVec<bool>
for nodes instead ofVec<Option<()>>
.
- Fixed an issue where closed nodes with lower f-costs were not being considered for the ideal path when checking neighbors.
- Added an optional
serde
feature for thePoint
struct. - Nodes now use
Point
s to represent their (x, y) coordinates. - Nodes now impl
From<Point>
andInto<Point>
. - Added missing doc comments.
Initial release.