在一个方位矩阵图中找到最大的连通分量?

I'm trying to find out it there is a way of finding the largest connected component in a adj matrix graph. Such as this:I'm trying to find out it there is a way of fin