Depth First Search vs Breadth First Search (Graph)

[@nsaccente]

This video was awesome. 30 minutes before my exam... thanks!

[@VenatorXVenator]

same

[@GtaRockt]

Hope you passed it

[@palincca]

This explained graph traversal so much better than my actual university prof... thank you!

[@danielediriweera7134]

This Help SOO much more than the other stuff out there thanks!

[@rezwanislam1332]

thank you so much for doing this in such a concise manner. I learned more from this short video than I did in a whole semester.

[@CorneliusPaardekooper]

This is an amazing way to understand the discrete mathematics applications using coding!

[@mikkoylimannila8104]

Thanks, this helped me in my computer science class!

[@ioannakartsonaki3351]

very well explained, thank you!

[@siomarapantarotto]

What a great explanation! Congrats and thanks for sharing this content.

[@zss123456789]

Is this a good answer to BFS vs DFS? "If you don't have to traverse through all nodes of the graph, BFS is generally a better approach since the probability of you traversing nodes unnecessarily is lowered. However, if you have to traverse through all nodes, there's no time difference, but DFS would be preferred because it's more memory efficient."

[@zss123456789]

Best one so far, subscribed!

[@frazebean5117]

Thank you mate I love your video.

[@asgm1382]

Awesome explanation!

[@MiCharlXXD4]

15 minutes before my exam..ThanksXD

[@gamer7234]

Great video

[@vusumuzingwazini3660]

Thank you! (Interview Prep)

[@user-sw1wq8lh2w]

wow, so good.

[@menoima9501]

omg bless you lad

[@SiddhantParkar]

Thank you, this helped

[@iam_kundan]

Great video !

[@adamhughes9938]

Excellent

[@SimoneAKABrigante]

Excellent video, thanks :)

[@anonim5052]

this should be not VS but AND

[@xyzoooo401]

Hi how is this linked to a stack ? Is stack only used for visualisation ? TIA The pseudo code seems much more straightforward. dfs(n, visited): print(n.value) for a in n.adjNodes { if !visited.contains(a) { dfs(n, visited) } }