Edwin Guo's Blog home

Tarjan

Tarjan算法，计算强联通图，缩点

思路：DFS结合栈次序

void tarjan(u) { dfn[u]=low[u]=++index; }

My github site
Mail to
Templet & Technical from

github.com/gqjjqg
qijiang.guo@gmail.com
github.com/mojombo

Subscribe to RSS Feed
Fork me on GitHub