hdu 4324 Triangle LOVE (targan判连通)

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4324

这题也是比较裸的题，

判断是否存在超过三个节点的强连通分量，由于题目说不存在两个节点的强连通分量。直接统计连通分量，如果总数小于初始的顶点数的话，就表示存在超过三个节点的强连通分量。

代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <iostream>

using namespace std;
const int maxn = 2005;
char G[maxn][maxn];

int t, n;
int dfn[maxn];
int low[maxn];
bool instack[maxn];
int Stack[maxn];
int index = 0, cnt = 0, top = 0;
void targan(int v) {
    dfn[v] = low[v] = ++index;
    instack[v] = true;
    Stack[++top] = v;
    for (int i = 0; i < n; i ++) {
        if(G[v][i] == '1') {
            if(!dfn[i]) {
                targan(i);
                low[v] = min(low[v], low[i]);
            }
            else if(instack[i]) {
                low[v] = min(low[v], dfn[i]);
            }
        }
    }
    if(dfn[v] == low[v]) {
        cnt ++;
        int k;
        do {
            k = Stack[top--];
            instack[k] = false;
        } while(k != v);
    }
}
int main() {
    scanf ("%d", &t);
    for (int i = 1; i <= t; i ++) {
        scanf("%d", &n);
        memset(G, 0, sizeof(G));
        for (int j = 0; j < n; j ++) {
            scanf("%s", G[j]);
        }
        printf("Case #%d: ", i);
        memset(dfn, 0, sizeof(dfn));
        index = cnt = top = 0;
        for (int i = 0; i < n; i ++) {
            if(!dfn[i]) {
                targan(i);
            }
        }
        if(cnt == n) {
            printf("No\n");
        }
        else {
            printf("Yes\n");
        }
    }
    return 0;
}