for(int i=0;i<=n;i++){
dfn[i] = 0;
low[i] = 0;
vis[i] = false;
first[i] = -1;
first2[i] = -1;///反向建边
color[i] = 0;
out[i] = 0;
pep[i] = 0;
}
弱弱问一句,什么那个语句时间复杂度是多少???
for(int i=0;i<=n;i++){
dfn[i] = 0;
low[i] = 0;
vis[i] = false;
first[i] = -1;
first2[i] = -1;///反向建边
color[i] = 0;
out[i] = 0;
pep[i] = 0;
}
弱弱问一句,什么那个语句时间复杂度是多少???
O(n)
确切来讲是 O(8n)
因为 8 比较小,所以忽略不计
即为: O(n)