给出一张图问是不是强连通
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
using namespace std;
#define N 500
struct node{
int from, to, nxt;
}edge[N * 2];
int head[N];
char l[N], h[N];
int m, n, tot;
int low[N], dfn[N], block[N];
vector<int> v[N]; //该连通子图内的点
int edgenum, all;
bool instack[N];
int stack[N], top, Time;
void init()
{
memset(head, -1, sizeof(head));
top = 0, edgenum = 0, tot = 0;
memset(instack, 0, si......
阅读全文