rudac 0.6.0

A crate for common data structures 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
23
24
25
26
27
28
29

# rudac

Rudac is a **Ru**st **D**ata structure and **A**lgorithm **C**rate.
It aims to be a comprehensive crate of usefull data structure and algorithms.

It is still an ongoing project.

**Documentation**: https://docs.rs/rudac

Data structures:
* Queue:
    - [Circular Queue / Circular Buffer](https://en.wikipedia.org/wiki/Circular_buffer)
* Heap:
    - [Binomial Heap](https://en.wikipedia.org/wiki/Binomial_heap)
    - [Fibonacci Heap](https://en.wikipedia.org/wiki/Fibonacci_heap)
    - [Min-Max Heap](https://en.wikipedia.org/wiki/Min-max_heap)
* Tree:
    - Binomial Tree
    - [AVL Tree](https://en.wikipedia.org/wiki/AVL_tree)
    - [Red-Black Tree](https://en.wikipedia.org/wiki/Red%E2%80%93black_tree)

Todo:
* "Circular Queue" Wiki
* "Binomial Heap" Wiki
* "Fibonacci Heap" Wiki
* "Min-Max Heap" Wiki
* "AVL Tree" Wiki
* "Red-Black Tree" Wiki
* :soon: [Interval Tree](https://en.wikipedia.org/wiki/Interval_tree)