http://threads-iiith.quora.com/The-Bridge-Tree-of-a-graph
Any feedback/suggestions are most welcome. :)
# | User | Rating |
---|---|---|
1 | jiangly | 3846 |
2 | tourist | 3799 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3590 |
6 | Ormlis | 3533 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
9 | Um_nik | 3451 |
# | User | Contrib. |
---|---|---|
1 | cry | 165 |
2 | -is-this-fft- | 161 |
3 | Qingyu | 160 |
4 | Dominater069 | 158 |
5 | atcoder_official | 157 |
6 | adamant | 154 |
7 | Um_nik | 151 |
8 | djm03178 | 150 |
9 | luogu_official | 149 |
10 | awoo | 147 |
http://threads-iiith.quora.com/The-Bridge-Tree-of-a-graph
Any feedback/suggestions are most welcome. :)
Name |
---|
What is the time complexity of the bridge tree building process?
O(N)
More bridge tree questions:
https://mirror.codeforces.com/contest/1000/problem/E
https://mirror.codeforces.com/contest/652/problem/E
I'm so confused. How does it differs from Block-cut tree ? Thanks in advance
In a bridge tree, every vertex corresponds to a 2-connected component, and edges correspond to bridges. If edge $$$(a, b)$$$ is on the path $$$u, v$$$ in the bridge tree, then the edge $$$(a, b)$$$ is a bridge that separates $$$u$$$ and $$$v$$$ in the original graph.
Block-cut trees are kind of similar, with cut vertices instead of bridges. It has the property that if vertex $$$x$$$ is on the path $$$u, v$$$ in the block-cut tree, then it is a cut vertex that separates $$$u$$$ and $$$v$$$ in the original graph.