Explanation for the article: www.geeksforgeeks.org/find-a-m... Read More: www.geeksforgeeks.org/find-a-... This video is contributed by Pranav Nambiar.
This is how I understand this algorithm: - If v is a mother vertex -> every vertices that can reach u are also mother vertices - With abover statement, if you do a DFS, and you traverse a mother vertex --> the initial vertex used to do DFS is also a mother vertex - After you do a DFS, if there is unvisted vertex(s) left in the graph -> the previous DFS did NOT traverse through a mother vertex - Repeat the above procedure then you will find the mother vertex (if the graph have one)
![NONT TANONT - ดอกไม้ที่รอฝน (spring) - Reimagined [Live Session]](http://i.ytimg.com/vi/nY2PsFZFEOg/mqdefault.jpg)
![หมานแต่ผัวเขา - แสตมป์ โตเกียวมิวสิค [ OFFICIAL MUSIC VIDEO ]](http://i.ytimg.com/vi/m0g1TSBJPgo/mqdefault.jpg)
Its already written on geeksforgeeks . we can also read . explain in simple manner .
Exactly, video is such a waste
that dude is just reading the lines -_- please give a visual example of the cases
This is how I understand this algorithm:
- If v is a mother vertex -> every vertices that can reach u are also mother vertices
- With abover statement, if you do a DFS, and you traverse a mother vertex --> the initial vertex used to do DFS is also a mother vertex
- After you do a DFS, if there is unvisted vertex(s) left in the graph -> the previous DFS did NOT traverse through a mother vertex
- Repeat the above procedure then you will find the mother vertex (if the graph have one)
This is correct, however the solution is not otimal O(V(V+E)), I'm trying to understand how the O(V+E) solution works.
@@garamburito he mentioned the O(V+E) only. Think about it.
i doubt this guy really understand what he is saying just reading from the line lol
Very good explanation 👍 thank you so much..
@GeeksforGeeks: The proof is not clear. I am confused in
case 1: if u finishes before v: then how this implies there is path from v to u ??
Because v must finish after u in DFS
Bhai padh rha he ki samjha rha hai
Nice explanation
Good explained
see on 1.5x speed his accent is more at that speed.
I am not trying to be prejudice, but i really want it be more audible.
Thank your for your feedback, Shiwei.
We will be adding subtitles to this video soon to supplement the shortcomings of the audio.
at 10:34 he is saying v = 5, but actually v should be 6 here
please try to be more audible. As I have to play it more than once to understand what you are saying.
bhai yar history ku rha hai..
Is geeksforgeek owned by Indian accent?
geeks for geeks has been made by Indian computer science students
GFG is product of IIT Roorkee (Mtech) pass out alumni.
Whats the problem with Indian? Its just an accent.
better proof can be given ...
He is not even good at reading things, and i was expecting an explanation😂😂🤣🤣🤣
bro use pen paper to explain
Good explained