pub struct AStar<'a, Node, Cost, DS, G>where
Node: Copy + Eq + Hash,
Cost: Copy + Ord + Default + Add<Cost, Output = Cost>,
DS: DiscoveredSet<Node, Cost>,
G: Graph<Node, Cost>,{ /* private fields */ }Expand description
Responsible for performing searches using the A* algorithm.
Implementations§
Auto Trait Implementations§
impl<'a, Node, Cost, DS, G> Freeze for AStar<'a, Node, Cost, DS, G>
impl<'a, Node, Cost, DS, G> RefUnwindSafe for AStar<'a, Node, Cost, DS, G>
impl<'a, Node, Cost, DS, G> Send for AStar<'a, Node, Cost, DS, G>
impl<'a, Node, Cost, DS, G> Sync for AStar<'a, Node, Cost, DS, G>
impl<'a, Node, Cost, DS, G> Unpin for AStar<'a, Node, Cost, DS, G>
impl<'a, Node, Cost, DS, G> UnsafeUnpin for AStar<'a, Node, Cost, DS, G>where
DS: UnsafeUnpin,
Cost: UnsafeUnpin,
impl<'a, Node, Cost, DS, G> UnwindSafe for AStar<'a, Node, Cost, DS, G>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more