http://threads-iiith.quora.com/The-Bridge-Tree-of-a-graph
Any feedback/suggestions are most welcome. :)
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
http://threads-iiith.quora.com/The-Bridge-Tree-of-a-graph
Any feedback/suggestions are most welcome. :)
Название |
---|
What is the time complexity of the bridge tree building process?
O(N)
More bridge tree questions:
https://codeforces.net/contest/1000/problem/E
https://codeforces.net/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.