flex-algo 0.7.0

Rust commonly used data structure and algorithms
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

use flex_algo::PriorityQueue;
use flex_algo::BinaryTree;

fn main() {
    let distances = [1, 6, 14, 2, 7];
    let mut pq = PriorityQueue::new(|a: &usize,b: &usize| distances[*a] < distances[*b]);
    assert_eq!(pq.is_empty(), true);
    pq.push(0);
    pq.push(1);
    pq.push(2);
    pq.push(3);
    pq.push(4);
    let value = pq.pop().unwrap();
    println!("pop priority queue(closure): {:?}", value);

    let mut tree = BinaryTree::new();
    let v = vec![Some(1), Some(2), Some(3), None, None, Some(4), Some(5), Some(6)];
    tree.insert(&v);

    // print in preorder
    tree.print_preorder(0);
}