#union-find #quick-union #quick-find #weighted-quick-union

wuf

A fast weighted implementation to the union-find problem with path compression

3 releases

Uses old Rust 2015

0.1.2 Oct 24, 2018
0.1.1 Oct 24, 2018
0.1.0 Oct 24, 2018

#27 in #union-find

MIT license

6KB
58 lines

Weighted Union-Find

A fast weighted implementation to the union-find problem with path compression.
Check out the documentation at: https://docs.rs/wuf/0.1.0/wuf/


lib.rs:

This is the documentation for wuf.

A fast weighted implementation to the union-find problem with path compression.

Examples

let n_nodes = 10;
let mut graph = wuf::Graph::new(n_nodes);
let node_id1 = 0;
let node_id2 = 1;
if !graph.connected(node_id1, node_id2) {
    graph.connect(node_id1, node_id2);
}

No runtime deps