Graph -13: Check if Directed Graph has Cycle (Using DFS)

[@afridimajeed5897]

Literally the only video on this topic that makes sense.

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@patrakarpopatlaltoofanexpr3258]

I waited 26 min, but in the end I can say its totally worth,
Your examples in b/w helped a lot to get the crux,
Wonderful explanation man,
Thank you

[@CodingSimplified]

Thanks for your nice feedback. Keep watching our other videos as well.

[@hemantsood9579]

I think on the graph this is most valuable content on youtube . I have searched so many content on graph but i found this is the most valuable..

[@CodingSimplified]

Thanks Hemant for your nice feedback. Keep watching.

[@adityahridyam7698]

Really after watching 2-3 videos. I got it from you. Thank you.

[@CodingSimplified]

Cool.

[@therealltrader2346]

your explanation helps me a lot i always find your video on youtube for any kind of coding problem

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@siddheshnalawade6547]

This is pure gold. The best explanation on youtube.

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@sufiyanshaikh1403]

Sir better than gfg explanation 🙌🙌

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@saunaknandi1814]

thank god i got a java tutorial again

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@ClashWithSwap]

Nice explanation. I like this more than the previous bfs one. Which is more optimal though?

[@CodingSimplified]

Well. If you see overall Time complexity is same. O(V + E), but if bfs, indegree operation is extra, so it'll have extra operation cost as well It's taking extra space to store Indegree in HashMap.
- So though Time complexity & space complexity both are linear in both approach, due to Indegree, bfs have more operation cost. Thanks.

[@f3-faithfitnessfinance]

What do you do?
You are working?

[@sujithgoud3535]

The best explanation

[@CodingSimplified]

Glad you liked it. Keep Watching.

[@ShreyaSingh-vr9qi]

Will the BFS indegree method to detect cycle will work when there is self-edge loop ??

[@roliverma4483]

yes

[@kavithaskitchen6482]

Visited[index]=true;
This one line code is not needed I feel.
Rest code is good..
Can you give me clarity for the mentioned code line code

[@rohangaonkar8912]

most elegent explanation

[@CodingSimplified]

Thanks Rohan for your feedback. Keep Watching.

[@coderbuddy3875]

Wonderful explanation I will give 5 star 👍👍

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@manasvijain7458]

I just have a small doubt why can't we use a similar approach to find a cycle in the Directed graph as we used for Undirected graph.

[@utkarshpravind2275]

can we used HashMap in place of recursive stack

[@roliverma4483]

best explanation

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.

[@LALIT_TRIGUNAYAT_MUSIC]

really a great explanation

[@CodingSimplified]

Thanks. Keep Watching.

[@Impromptu21]

In ur example what if there is edge from 3 - 0 instead of 0-3 . I think it will not work

[@ravirai5439]

is it possible to solve using only visited array?

[@CodingSimplified]

Visited array is just helper variable. You need to have DFS thing which is necessary here.

[@PankajGupta-gh9cm]

how to edit multiple line in Eclipse

[@CodingSimplified]

Alt + shift + R is another way of refactoring, but I would suggest to search on google as per your specific request. Hope it helps you. Thanks.

[@utkarshgangwar2173]

best explanation

[@CodingSimplified]

Thanks for your nice feedback. Keep Watching.