recategorized by
431 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.

recategorized by

1 Answer

Related questions

2 votes
2 votes
1 answer
2
vishwa ratna asked Nov 10, 2016
2,490 views
How many times 8 is pushed into stack ? a detail answer will be welcomed.
1 votes
1 votes
2 answers
3
Parshu gate asked Nov 18, 2017
1,445 views
1 votes
1 votes
2 answers
4
Mojo-Jojo asked Jan 8, 2016
1,127 views
DFS