Struct UnionFind 

pub struct UnionFind { /* private fields */ }

Union-Find data structure with path compression and union by rank.

Implementations

impl UnionFind

pub fn new(n: usize) -> Self

Create new Union-Find with n singleton sets.

pub fn len(&self) -> usize

Number of nodes.

pub fn is_empty(&self) -> bool

Check if empty.

pub fn num_components(&self) -> usize

Number of disjoint components.

pub fn find(&mut self, x: NodeId) -> NodeId

Find representative of node’s component with path compression.

pub fn union(&mut self, x: NodeId, y: NodeId) -> bool

Union two components by rank.

Returns true if a merge occurred (x and y were in different components).

pub fn connected(&mut self, x: NodeId, y: NodeId) -> bool

Check if two nodes are in the same component.

pub fn component_ids(&mut self) -> Vec<ComponentId>

Get component ID for each node.

Returns a vector where result[i] is the component ID of node i. Component IDs are assigned 0, 1, 2, … based on root nodes.

pub fn component_size(&mut self, x: NodeId) -> usize

Get the size of the component containing node x.

Trait Implementations

impl Clone for UnionFind

fn clone(&self) -> UnionFind

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for UnionFind

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.