algonium 0.1.0

a collection of classic algorithms for programming contests
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12

//! data structures for efficient operations
//!
//! This module contains these data structures
//! * [`BIT`](struct.BIT.html) - Binary Index Tree (Fenwick Tree)
//! * [`BITRange`](struct.BITRange.html) - Binary Index Tree (Fenwick Tree) + range add
//! * [`UnionFind`](struct.UnionFind.html) - Disjoint-set (Union-find) data structure
//!
mod bit;
mod union_find;

pub use self::bit::{BITRange, BIT};
pub use self::union_find::UnionFind;