disjoint-sets 0.2.0

Two union-find implementations
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

//! Three union-find implementations
//!
//! The variants are:
//!
//!  - [`UnionFind`](struct.UnionFind.html): An array-based union-find
//!    where clients represent elements as small unsigned integers.
//!  - [`UnionFindNode`](struct.UnionFindNode.html): A tree-based
//!    union-find where each set can have associated ata, and where
//!    clients represent elements as opaque tree nodes.
//!  - [`AUnionFind`](struct.AUnionFind.html): Like `UnionFind`, but
//!    it’s `Sync` for sharing between threads.
//!
//! All three perform rank-balanced path compression à la Tarjan,
//! using interior mutability.

mod traits;
mod array;
mod tree;
mod async;

pub use traits::*;
pub use array::*;
pub use tree::*;
pub use async::*;