推 Transfat: 找articulation point,切開之後就可以看到有多少個 01/17 16:48
→ Transfat: connected component 01/17 16:48
→ kk8850tw: 因為是undirected graph, 所以任2點都存在雙向路徑 01/17 16:50
→ bemybaby: 可是答案給我1耶 01/17 16:52
推 Transfat: 啊啊我講錯了，我講的是Biconnected component 01/17 16:52
→ Transfat: 是1沒錯，我講完就覺得怪怪的，connected component我們 01/17 16:53
→ Transfat: 通常就當作maximal connected component,這題就是整棵樹 01/17 16:53
→ Transfat: 了 01/17 16:53
→ bemybaby: 原來是這樣 所以不能切 01/17 16:53
→ bemybaby: 好的謝謝你們 01/17 16:53
→ kk8850tw: 樹是conected graph 01/17 16:54
→ kk8850tw: 只要沒有disjoint set就是connected, 有幾個disjoint se 01/17 16:56
→ kk8850tw: t就有幾個component 01/17 16:56