Struct MinHeap 

pub struct MinHeap<Node, Cost>
where
    Node: Copy,
    Cost: Copy + Ord,
{ /* private fields */ }

A binary min-heap implementation of the discovered set.

Trait Implementations

impl<Node, Cost> Clone for MinHeap<Node, Cost>

where Node: Copy + Clone, Cost: Copy + Ord + Clone,

fn clone(&self) -> MinHeap<Node, Cost>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<Node, Cost> Debug for MinHeap<Node, Cost>

where Node: Copy + Debug, Cost: Copy + Ord + Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<Node, Cost> Default for MinHeap<Node, Cost>

where Node: Copy + Default, Cost: Copy + Ord + Default,

fn default() -> MinHeap<Node, Cost>

Returns the “default value” for a type.

impl<Node, Cost> DiscoveredSet<Node, Cost> for MinHeap<Node, Cost>

where Node: Copy, Cost: Copy + Ord,

fn push(&mut self, node: NodeCost<Node, Cost>)

Pushes the node with its associated f(n) cost.

fn pop(&mut self) -> Option<NodeCost<Node, Cost>>

Pops the node with the lowest f(n) cost.

fn clear(&mut self)

Removes all the nodes from the set.