Hi, Certainly I can say you have an art to make people understand the most complex topics of computer science without spending hours of time and EVEN WITHOUT SPEAKING, I loved the way you taught me this topic and other topics too. Please accept my thanks!!
hello, I am from Bangladesh. precisely I liked the way you had explained DFS and BFS without making any single sound. it's really helpful for me. thanks a lot. :)
At 6:10, I do not understand how you got that as your output. It should be S C B A E D T F if you use the "shortest edge distance". Why do you have A B C? A is the farthest from S.
And at 10:0 why do you go from C to D? I feel you should go to F because the edge distance is less. I know see perhaps you are ignoring edge distance and only going by lowest alphabetical?
Hi, Thanks for the video! In the last example of DFS when T was visited, there was no more vertex to visit so we went back to S, instead of doing that we can be back to E only not to S and could visit C. is that correct approach??
+Yanuar Tri Aditya Nugraha Because we need a way to tell if a node has once been visited. Otherwise, there is no way to tell and it will keep iterating nodes infinitely. Does it make sense?
+Gyu-Ho Lee Thanks a lot. I've enjoyed your channel for this past week. Especially on your sorting, where you also add concurrencies. Good job and keep it up.
Hi,
Certainly I can say you have an art to make people understand the most complex topics of computer science without spending hours of time and EVEN WITHOUT SPEAKING, I loved the way you taught me this topic and other topics too.
Please accept my thanks!!
***** you're the man
Having the Graph and Trees side by side were very helpful, the animations were too! Thank you!
Really helpful for those who are confused about BFS & DFS. Great work!!
hello, I am from Bangladesh. precisely I liked the way you had explained DFS and BFS without making any single sound. it's really helpful for me. thanks a lot. :)
At 6:10, I do not understand how you got that as your output. It should be S C B A E D T F if you use the "shortest edge distance". Why do you have A B C? A is the farthest from S.
Great work, can you make a video for BFS and DFS for directed graph..(single direction)?
Thanks, its useful
can i ask you on which program you have designed this video ?
+Unlimited Knowledge Thanks. I used OS X Keynote.
No sound, but still very good explanation. Thank you!
+selfie side Thanks!
And at 10:0 why do you go from C to D? I feel you should go to F because the edge distance is less. I know see perhaps you are ignoring edge distance and only going by lowest alphabetical?
Hi,
Thanks for the video! In the last example of DFS when T was visited, there was no more vertex to visit so we went back to S, instead of doing that we can be back to E only not to S and could visit C. is that correct approach??
hiii, can you make a video on identification of articulation point using (DFS).
In "try this with DFS", why E goes to F instead of C? Could you please explain the reason?
I got the output of S-A-B-D-E-C-F-T.
In try this with dfs ,
Correct me if im wrong , i think e should visit c not s?
In a DFS do we just ignore the weights and go in alphabetical order; or is there cases where you put the weight into considoration with DFS?
+Kim Wahlman DFS just visits whatever pops first from the stack, without considering the weights, in this case. Thanks,
Oh ok, thanks :) is there any case where DFS will consider the weights?
Kim W Kim W yes, when you're told to follow weights oppose to the node
where is your mic dude :)
perfect video, Greetings from México.
anyone can explain why after a vertex has been visited, it has to be colored to black?
+Yanuar Tri Aditya Nugraha Because we need a way to tell if a node has once been visited. Otherwise, there is no way to tell and it will keep iterating nodes infinitely. Does it make sense?
+Yanuar Tri Aditya Nugraha If this doesn't make sense, please visit github.com/gyuho/learn/tree/master/doc/go_graph_traversal
Thanks,
+Gyu-Ho Lee Thanks for the reply, at first I thought that once an adjacent vertex has been colored GRAY, it's enough to say that it's done.
+Gyu-Ho Lee Thanks a lot. I've enjoyed your channel for this past week. Especially on your sorting, where you also add concurrencies. Good job and keep it up.
+Yanuar Tri Aditya Nugraha Thanks! You might like this as well. github.com/gyuho/learn
Most recent tutorials will be updated in GitHub.
I like it. It help me so much Thank you
兄弟好，感谢拍视频！
respect to this guy
Wow, good job!
Great!
helpful :)