in DS recategorized by
439 views
0 votes
0 votes

 

I want to find the articulation point and bridges in the above graph.

 

Further for each vertex $v$ I want to compute

$v.low=$min $\left \{ v.d, w.d \right \}$

where

$v.d$=discovery time of vertex v

$w.d$=discovery time of vertex w, (u,w) is a back edge for some descendant $u$ of $v$

Below is the DFS tree (Back edges are indicated by B) I constructed

Can someone help me with the values of v.low ?

Because based on v.low I will be further able to solve articulation point and bridge problem.

in DS recategorized by
439 views

1 Answer

0 votes
0 votes
articulation point is one

i.e is node (1)