Struct rs_graph::collections::BinHeap

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

Simply binary heap data structure.

Implementations

impl<K, V, ID> BinHeap<K, V, ID>

pub fn new() -> Self

Trait Implementations

impl<K, V, ID> Default for BinHeap<K, V, ID>

fn default() -> Self

Returns the “default value” for a type.

impl<K, V, ID> ItemPriQueue<K, V> for BinHeap<K, V, ID>where K: Clone, V: PartialOrd + Clone, ID: FromPrimitive + ToPrimitive + Copy + Eq,

type Item = ID

Handle for an item in the queue.

fn clear(&mut self)

Remove all elements from the queue.

fn is_empty(&self) -> bool

Return true iff the queue contains no element.

fn value(&self, item: &ID) -> &V

Return the current value associated with some item in the queue.

fn push(&mut self, key: K, value: V) -> ID

Push the element with given key and value onto the queue.

fn decrease_key(&mut self, item: &mut ID, value: V) -> bool

Decrease the value of some item in the queue.

fn pop_min(&mut self) -> Option<(K, V)>

Remove and return the element with the smallest value from the queue or None if the queue is empty.