Graph Traversals

[@keepgoingo]

Just 10 minutes make me clearer
Thanks for uploading this video!

[@brob925]

I would have never guessed the process was actually this simple after listening to my prof attempt to explain it...

[@abbasahmed3330]

THANK YOU YOU ARE AMAZING
9 MIN OF PURE UNDERSTANDING

[@gsrftmfw]

I can't believe I'm paying my school thousands of dollars to learn off youtube. What a complete joke! Many thanks for the video. It was extremely helpful.

[@savanpatel7]

Awesome and thank you verry much to the one who have uploaded it..thanks a lot I have never Imagined that it could be so simple...

[@MyRandomReviews]

I was a little unsure at first and this has cleared everything up. Thank you!

[@berserkforeal6953]

This was an incredible video explanation, im glad i found this, now im able to actually understand and practice this. Thank you for your explanation and please keep up the amazing tutorials.

[@EcstasyDeceptions]

Thank you so much, I really needed this video! I finally understand DFS and BFS now and their differences. Thanks again!

[@TheBobby109]

very good video. It helped me a lot. Keep this good work. I really appreciate your work and effort. And the presentation was also very nice. Thanks a lot.

[@crazyidiot101]

Why can't professors just watch videos like these and teach us...it would make life so much better

[@kose241]

Easy to understand. Great tutorial!

[@Kokoberk]

thanks for taking the time to explain, very helpful

[@PaTTaMoNE]

Thank you very much.
You are really really a good teacher.
Please make more.
I am looking forward being your student :)
Thanks Again :)

[@gsrftmfw]

@GloriesH since there are no weights associated with the edges, he picks the next node that is smaller in alphabetical order. For example B is less than D and H is greater than C.

[@praslisa]

awesome !!! wish all profs would teach like you !! thank you so much !
If you decide to do dvds or books I will buy them !!!! Best

[@cohnai]

more or less saved me.
for some reason the book just showed me silly pictures instead of telling me how to do it.

[@zeeshan0026]

thank you sir . I didnt take lecture of graph. i was worry that how i will cover my lecture.this video make me worry free.

[@xiqum]

Thanks, a very good and easy to understand video.

[@mavrikis20]

man ur a GOD really, keep the good work!

[@zooberry]

this video saved a lot of time. thx :)

[@gwill1231]

i knew my professor was just lying to us.. thanks dude.

[@bytedildo]

dude ,you are great! Hope you do a simulation on iterative deepening to :)

[@PauloZiemer]

good and simple explanation... thanks for the video

[@a4finger]

good video, but I wish u included the distance from the source and the previous node of the graph

[@stringjourney]

Wonderfully explained

[@NattyDread91]

thank you very much, it's been very helpful

[@_krazy_kenny]

Great job, very informative

[@AnishKaranPhotography]

very well explained...great job

[@maxicc4]

Muy buen video, perfecta la explicación!

[@MonsterJail]

This video really helped, thanks

[@XSX4y]

I think it's better to think about queue as a horizontal line, but anyways you're great!

[@Demnior]

Great explanation!

[@likearollinstonem9924]

awesome explanation !

[@humayunmailbox]

very well explained.. like it.

[@ejasejas91]

very impressive work.....

[@savrajqwerty]

Thanks !! Awesome vid.

[@jeff_7771]

great vid. really helpful!

[@uzeirdalip9499]

great explanation, thank you!

[@TheBlarghzorz]

very helpful and informative thanks

[@shoummorauth]

Excellent....u rock!

[@shortielong]

My lecturer used 2 hrs to explain but still I cannot understand.
You used 10 mins to explain and I understand the whole thing now.

[@Galiliozz]

Simply ,Thank You :)

[@Sanatem93]

THE BEST MAN!

[@biswajitsadhu3607]

Thanks nice one.. Simple and short ..:)

[@ThemisTheotokatos]

how can two processes traverse a graph in parallel without visiting what is visited by each other?

[@TheBurninice]

best class... thank you...

[@cloudgiant]

thanks a lot! Great video :)

[@aetaey]

[@niruandpradeep]

extremely helpful

[@empecinado1978]

Muchas gracias.
Thanks.

[@naeemdotnaeem]

Good video.
at 4.30 result for DFS:
Preoder: ABEGFCHD and Postorder: GEHCDFBA

[@TJSIlver]

Thank U! it was very helpful

[@ShaheenGhiassy]

Very clear. Thx!

[@khcoolharsh0]

great video thanks :)

[@elgonost]

great video thank you

[@82windows82]

THANK YOU!

[@khmustafaa]

thanx you r very cool man u r the best thanx

[@ValeronDude]

great explanation, thanks :)

[@necromaniac9292]

Hope you're my lecturer :D

[@nitdgp18]

gr8 video... oooops...
dude u r gr8...

[@SasikaKalupahana]

thank you.. really helpful.. :)

[@xiangq27]

gr8, it's awesome

[@789hkl]

awesome!!!

[@supunjayasekara9147]

Yehh. It's very coll.. thanks sir..

[@mati4155]

Thanks a lot! Heh, I should've attended lectures ;)

[@tishaniii]

Very helpful!

[@mitkraValle]

THANKS!!

[@Funtasmia]

Can somebody tell me the connection between Tree Search, Graph Search, and Breadht-first Search please?

[@pixie2693]

thank you so much.......

[@evgageforce]

USEFULL TY!!!!!!

[@jeffmanuel5]

clear....and perfect .......:D

[@PAULUR06]

GREAT!

[@darkamlan]

how 2 download this vedio
??

[@ThemisTheotokatos]

that is were the future schools are going I think. See khan academy as one of an example

[@DeeepanjanDeys]

Thanks a Lot

[@samarabdelmowgoud7021]

Thank you soooooooo much

[@chrestienjohnny]

awesome

[@moobsies]

Don't you add all neighbors to stack? You are just adding highest priority neighbor.

[@Gam3Fr3ak_SFA_YT]

THANKSSSSSSSS

[@DianaDelibaltov]

How is this not the top comment??

[@aXque]

Do IDA and A*

[@iPorn1337]

thx

[@aetaey]

[@funkmasterflex91]

now to do it in smalltalk....T_T

[@titoink]

@crazyidiot101 hahah and all in jut nine minutes...hahah even lectures will be shorter! hahahh why do they complicate our lifes!! geez! hahhah

[@strike325]

this is the worst song ever.

[@anandsaha01]

Awesome explanation!

[@shoummorauth]

Excellent....u rock!

[@ChuyenTrungTran]

Thanks a lot