### Baba's blog

By Baba, 6 years ago,

Any feedback/suggestions are most welcome. :)

• +24

 » 4 years ago, # |   0 What is the time complexity of the bridge tree building process?
•  » » 4 years ago, # ^ |   0 O(N)
 » 2 years ago, # | ← Rev. 4 →   +9 More bridge tree questions:https://codeforces.com/contest/1000/problem/Ehttps://codeforces.com/contest/652/problem/E
 » 7 weeks ago, # |   +6 I'm so confused. How does it differs from Block-cut tree ? Thanks in advance
•  » » 7 weeks ago, # ^ |   +1 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.