Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
总觉得Tarjan算法求有向图的强连通分量不大好~好像会漏掉些特殊情况似的,比如、、、5条边4个点的图 边: 0 1 1 2 2 0 0 3 3 1 这个图是个强连通图 哪位大牛可以给个准确的Tarjan算法,有些人写的算法会把0 1 2归到一个强连通分量里,但是3却归不进去。 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator