547. Friend Circles

查看题目

可以先求出矩阵的闭包，再判断有几个强连通图
使用Floyd-Warshall算法算法求出闭包，一个强连通图代表一个Circle

class Solution {
public:
    int findCircleNum(vector<vector<int>>& M) {
        int size = M.size();
        vector<vector<int> > M2(M);
        //求出闭包
        for (int k = 0; k < size; k ++) {
            for (int i = 0; i < size; i ++) {
                for (int j = 0; j < size; j ++) {
                    if (M2[i][k] && M2[k][j]) M2[i][j] = 1;
                }
            }
        }
        int cnt = 0;
        //判断强连通图的个数
        for (int i = 0; i < size; i ++) {
            if (M2[i][i] == 1) {
                cnt ++;
                M2[i][i] = 2;
                for (int j = i+1; j < size; j ++) {
                    if (M2[j][j] == 1 && M2[i][j] == 1) {
                        M2[j][j] = 2;
                    } 
                }
            }
            
        }
        return cnt;
    }
};