Trait DiscoveredSet 

pub trait DiscoveredSet<Node, Cost>
where
    Node: Copy,
    Cost: Copy + Ord,
{
    // Required methods
    fn push(&mut self, node: NodeCost<Node, Cost>);
    fn pop(&mut self) -> Option<NodeCost<Node, Cost>>;
    fn clear(&mut self);
}

Responsible for keeping track of the discovered nodes.

Required Methods

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.

Implementors

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

where Node: Copy, Cost: Copy + Ord,