algs4 0.7.0

Algorithms, 4ed. MOOC in Coursera. in Rust.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44

// Week 4: Priority Queues


pub trait MaxPQ<Key: PartialEq> {
    /// create an empty priority queue
    fn new() -> Self;
    /// create a priority queue with given keys
    fn from_vec(a: Vec<Key>) -> Self;
    /// insert a key into the priority queue
    fn insert(&mut self, v: Key);
    /// return and remove the largest key
    fn del_max(&mut self) -> Option<Key>;
    /// is the priority queue empty?
    fn is_empty(&self) -> bool;
    /// return the largest key
    fn max(&self) -> Option<&Key>;
    /// number of entries in the priority queue
    fn size(&self) -> usize;
}


pub trait MinPQ<Key: PartialEq> {
    /// create an empty priority queue
    fn new() -> Self;
    /// create a priority queue with given keys
    fn from_vec(a: Vec<Key>) -> Self;
    /// insert a key into the priority queue
    fn insert(&mut self, v: Key);
    /// return and remove the smallest key
    fn del_min(&mut self) -> Option<Key>;
    /// is the priority queue empty?
    fn is_empty(&self) -> bool;
    /// return the smallest key
    fn min(&self) -> Option<&Key>;
    /// number of entries in the priority queue
    fn size(&self) -> usize;
}


pub mod unordered;

pub mod binary_heaps;

pub mod event_driven_simulation;