 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
Re:您这个并查集能用在有向图么？ 而且能仔细分析一下复杂度么？In Reply To:您这个并查集能用在有向图么？ 而且能仔细分析一下复杂度么？ Posted by:sunmoonstar_love at 2005-09-02 13:29:03 如果有有向圈(环)的话,将该圈上的顶点存储在一个集合中,算是并查集吧,为的是以后 方便,一个并查集中的顶点就可以看成一个点了. 复杂度....(如果这样方法是正确的话) 貌似O(e+n*n),只因它比n*e的DFS做了些优化,个人认为不应该是O(n*e)吧. Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
