Struct rs_graph::shortestpath::binheap::BinHeap

pub struct BinHeap<K, ID = u32> { /* private fields */ }

Simply binary heap data structure.

Trait Implementations

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

type Item = ID

Type of items on the heap.

type Key = K

Type of keys.

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: K) -> ID

Insert a new item into the heap.

fn decrease(&mut self, item: ID)

Decrease the key of an item.

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

Return the minimal key.

fn key(&mut self, item: ID) -> &mut K

Returns the current key of an item.