Leetcode 924. Minimize Malware Spread

Given an undirected graph and a set of initially infected nodes, choose one initial node to remove so that the eventual malware spread across connected components infects the fewest nodes. The core challenge is to identify connected components and pick the node that is the sole infected node in the largest component (tie-breaking by smallest index).