06. Depth First Search DFS | Graph Traversal Algorithm | Coding Blocks

[@ishanarya4847]

Learned about templates :) apart from DFS implementation. The content is great! Keep it up Coding Blocks.

[@angellanyundo795]

well explained both DFS & BFS learned alot

[@rohitmathur9723]

Your way of explanation is really easy and Great!

[@jatinkumar4410]

both bfs and dfs videos are amazing...

[@Rahulkumar-op9lu]

great explanation with neat and clean code hatss off sir 🙏🙏🙏

[@ashirbadbehera5544]

thanks prateek bhaiya for your hard work.

[@bloke3253]

Audio is not audible enough.

[@sauravchaudhary3064]

Thanks Prateek.

[@augustomaillo2324]

Nice video! Thank you!

[@mydaughtersaanvi.daddalove8401]

voice recording quality needs to be worked on. Still, the content is good.

[@thisisme157]

which application did you use to draw on windows screen

[@dipeshrawat3762]

Sublime

[@PrateekNarang27]

Demo Pro

[@user-pw7rf1tk9o]

What Will be effect on 2021 placements due to carona virus

[@zaryabmalik1323]

Which compiler is used?

[@gauthamalva8701]

soo smooth

[@abhishekgupta3698]

visited[node]=false didnt get plz explain

[@abhishekgupta3698]

@@amittiwari360 but he had written false check the video

[@abhishekgupta3698]

@@amittiwari360 thanks

[@AmitKumar-ll7jg]

@@amittiwari360 glt bol rhe ho tum

[@AmitKumar-ll7jg]

@@abhishekgupta3698hmne visited naam ka map bnaya h... visited[node] = false ka mtlb bs y hai ki hmne starting m visited map ko sbhi vertices k liye false initialize kia h kyuki starting m sbhi vertices not visited rhenge. Uss for loop k upar comment m likha to hua h marking all the nodes as not visited in the beginning.

[@abhishekgupta3698]

@@AmitKumar-ll7jg Thanks buddy

[@arpitkhandelwal6050]

this program does throw an error when we use string instead of int.

[@ankitaugale4551]

It doesn't. Maybe you are doing something different

[@vedanshsharma9807]

very bad audio quality, not audible at all!!