Strongly connected components

#1

it is mentioned in video at time 6:05 that read first dfs tree and backedge but there is no video for this topic…

#2

hi @shampblocks its given under the video of topic articulation points and bridges, look for it under the graph section. The name is mentioned around 5:30

#3

But there is no topic articulation point video in the coarse??

#4

@shampblocks which course are you enrolled in?

#5

Algo++… .

#6

@shampblocks the concepts have been explained later in the video itself, still you can refer to this https://www.geeksforgeeks.org/tree-back-edge-and-cross-edges-in-dfs-of-graph/

Also this article has wonderful explanation of DFS tree along with an animation, do give it a read https://codeforces.com/blog/entry/68138

#7

Later means?? At which timestap it is explained??

#8

@shampblocks did you watch the whole video?

#9

No when I saw the prerequisite at 6:05 then I stopped it and raised doubt where is that topic is that in video??

#10

@shampblocks please watch the video sir has explained a little bit there also, you shouldnt face any problem.

#11

Ohk mam thanks… I should watch full video first… Then will ask doubt if there is any…

1 Like
#12

Can you tell the timstamp at which that topic taught so that I can see it first??

#13

@shampblocks just watch the whole video everything is taught in a flow

1 Like
#14

Ohk will watch … You said in previous message that it is in video that’s why I said for timstamp…

#15

@shampblocks please mark this doubt as resolved if it is clear now

#16

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.