How can we find the largest contiguous region of a graph with two different “ID”s?

Question

I\'ve recently learned about the Flood-Fill Algorithm, an algorithm that can take a graph and assign each node a component number in O(N) time.