Figure 6. Detailed view of T for one i ∈ { 1 , 2 } . Path P is highlighted. Recall that vertices i i of the bridge tree are counted according to the size of the respective BCC s. Here, in this example, we assume that each vertex counts 1 . The path is drawn accordingly, i.e. , always descending into a subtree with a maximum number of