Trait rs_graph::shortestpath::heap::Heap

pub trait Heap {
    type Item;
    type Key;

    fn new() -> Self;
    fn clear(&mut self);
    fn is_empty(&self) -> bool;
    fn insert(&mut self, key: Self::Key) -> Self::Item;
    fn decrease(&mut self, item: Self::Item);
    fn pop_min(&mut self) -> Option<Self::Key>;
    fn key(&mut self, _: Self::Item) -> &mut Self::Key;
}

Interface for heap data-structures.

Required Associated Types

type Item

Type of items on the heap.

type Key

Type of keys.

Required Methods

fn new() -> Self

Return a newly allocated heap.

fn clear(&mut self)

Remove all elements from the heap.

fn is_empty(&self) -> bool

Return true if heap is empty.

fn insert(&mut self, key: Self::Key) -> Self::Item

Insert a new item into the heap.

fn decrease(&mut self, item: Self::Item)

Decrease the key of an item.

fn pop_min(&mut self) -> Option<Self::Key>

Return the minimal key.

fn key(&mut self, _: Self::Item) -> &mut Self::Key

Returns the current key of an item.

Implementors

impl<K, ID> Heap for BinHeap<K, ID>where
    K: Copy + PartialOrd,
    ID: PrimInt,

type Item = ID

type Key = K