A <connected component> of an <undirected graph> is a maximal set of <vertices> such that each pair is joined by a <path>. Equivalently, components are the <equivalence classes> of the relation “reachable by a path”. The length-zero path ensures that an isolated <vertex> is a one-vertex component.

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 / a / Solution

 Solution (source code)