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);
}