Test \b[`Find-Set(u) == Find-Set(v)`]. Initially the sets are singleton <connected components> of the edgeless graph; processing an edge joins precisely the components it connects. By <induction> over the processed edges, the final sets are exactly the <connected components> of $G$.

Solution

Past exam of the year 1 of the computer science course of the University of Oxford / 2016 / Functional programming, design and analysis of algorithms (resit) / 5 / e / Solution

 Solution (source code)