Tarjan
摘要:
//-----------Tarjan-------------int dfn[MAXNODE],low[MAXNODE],index;int stack[MAXNODE],top;int id_scc[MAXNODE],cnt_scc;void Tarjan(int i){ int j; dfn[i]=low[i]=++index; stack[++top]=i; for(Node *p=G[i];p;p=p->next) { j=p->num; if(!dfn[j]) { Tarjan(j); ... 阅读全文
posted @ 2011-09-15 22:09 _Never_ 阅读(244) 评论(0) 推荐(0)
浙公网安备 33010602011771号