Breadth First Search and Depth First Search Traversal Methods of a Graph. with valid and invalid examples.
Жүктеу.....
Пікірлер: 82
@Genivaldo_Gueiros7 жыл бұрын
Thanks a lot. It was the best material I found about the topic!
@roshansah5155
2 жыл бұрын
Sir now where r u..
@PositiveZahid7 жыл бұрын
Excellent example and comparison i have ever seen. Thanks for this excellent video discussion.
@sinto4105
4 жыл бұрын
at 3:10 he forgets to add 9 I think
@pratibhasingh89994 жыл бұрын
Thank you so much sir for clear explanation
@mounikareddy38967 жыл бұрын
you have explained it good but you have forgotten the element 9 in the traversal
@hamzashamshad46896 жыл бұрын
Nice explanation... made me clear about different outcomes of BFS and DFS, may Allah bless u!
@isururambandarage14216 жыл бұрын
Great video, thank you very much...
@amu34277 жыл бұрын
Thanks. It was very useful👌👌
@AkshayKumar-dl1km6 жыл бұрын
Sir in bfs spanning tree 4 is not connected to 3...???
@ItachiUchiha-ub2iu5 жыл бұрын
Are vertex and node same term in graph?
@jyothikoushik81216 жыл бұрын
Sir should I consider the alphabetical order.. Only?!
@lozanhalabi67214 жыл бұрын
you are the best ever !
@Chetan.Kothari4 жыл бұрын
Thank you so much!!!
@harshsharma25056 жыл бұрын
awesome explanation
@upendrakushwaha51236 жыл бұрын
how can i decide which one go left and which one right
@hackerstube27396 жыл бұрын
Love you man! Just before xam 😊😊😊😊u killed it
@Amitsa2996 жыл бұрын
first time i understand it properly
@c.danielpremkumar84956 жыл бұрын
Before starting the 'search', how is the Graph represented for enabling the searching operation ?
@darXer0
3 жыл бұрын
Adjacency Matrix bantaa hai.
@tanvirhossain33717 жыл бұрын
effective .. very much effective !!
@utsavthakur8566 Жыл бұрын
In the BFS example, why is 9 not in the queue?
@sujathasivakumar64226 жыл бұрын
Super sir really it was good
@iconcentrateonmyself6 жыл бұрын
Tq sir for ur awesome explanation. Tq sir
@aishwaryakadam9564 жыл бұрын
please join our university.... we really need professor like you
@raghavgupta6536
3 жыл бұрын
+1
@molyoxide8358
Жыл бұрын
he's already present in KZread University.
@ashish3saxena5 жыл бұрын
Thank You so much
@languageofuniverse5 жыл бұрын
very delicious leacture ty...
@sohamchoulwar1700
4 ай бұрын
Bro, what??
@sunshine61192 жыл бұрын
thank you thank you 🥺
@GyaaniUser5 жыл бұрын
Sir ur videos are so helpful throughout the semester. Leraned alot from series of videos.Thank you so much. Sir, plz also consider the Amortized Analysis Chapter and make videos for that also.
@sinto4105
4 жыл бұрын
at 3:10 he forgets to add 9 I think
@sagarjain4128
2 жыл бұрын
@@sinto4105 Yes, He forgot
@somiashobo83597 жыл бұрын
thanx alot may Allah bless u awesome explanation...
@ShubhamKumar-xg3hc2 жыл бұрын
Thank you sir 🙏
@vimeshguna70979 ай бұрын
Best explaination
@furkhanmehdi64056 жыл бұрын
bari sir thanks...
@mohitpawar107 жыл бұрын
Their is mistake in bfs. You did not visited 9 in bfs.
@aaminashaikh778
6 жыл бұрын
mohit pawar yes, not visited 9
@singh_gurjyot
5 жыл бұрын
doesn't matters, because only 3 is adjacent to it, which has already been visited
@MDASIF-wo7ck3 жыл бұрын
Well explained
@ItachiUchiha-ub2iu5 жыл бұрын
DFS is a graph traversal technique which use 'back tracking' method to visit it previous node.
@abhinashjena216 Жыл бұрын
Can u please make a video on overall dsa content for basic to advance
@kunalkheeva Жыл бұрын
thank you!
@RohitKumar-zp6ci2 ай бұрын
At 3:28 why didn't we put 9 in the queue?
@shaikhibza85964 жыл бұрын
Sir please explain me videos on minimum cost spanning tree by using sollens algorithm sir
@ashishsinha88936 жыл бұрын
sir I m waiting for your next videos.... sir upload please..
@zarwabutt46616 жыл бұрын
addition to not visiting vertex 9, when u made spinning tree, i could not understand....where was the relation between 3 and 4 ? plz answer so that i could overcome my confusion ..
@zarwabutt4661
6 жыл бұрын
sure sir.... its 5:19 ... when we made graph, we see it have a relation b/w 3 and 4 ...but when we made the tree ... what would become of that.... this was the bit of a confusion .... :)
@zarwabutt4661
6 жыл бұрын
thanks alot sir for help :)
@tonnysaha1175 жыл бұрын
Thank u sir
@ahsanraju13 жыл бұрын
Good lecture
@Anytime4yo6 жыл бұрын
thnx sir ,,,,,,,,,,,,,,,,
@munavvaralam12435 жыл бұрын
Gazab sir
@adarsh13606 жыл бұрын
Sir does your Playlist on algorithm complete ??? If it ain't then please complete 8t before 15 of this month..🙏ty for consideration.
@adarsh1360
6 жыл бұрын
We have upcoming end sem from next month plus i have to go for gate prep
@adarsh1360
6 жыл бұрын
You are doing excellent job sir Allah is showing kindness to us through you sir
@adarsh1360
6 жыл бұрын
Nope it's complete. Go for data structure as well sir
@jeffinsvarghese89075 жыл бұрын
There's a mistake. You did not add 9to the queue
@gandharavkatyal8227 жыл бұрын
thanx :)
@safaaal-wajidi46067 жыл бұрын
thanks
@vrushalikokarebarkade88735 жыл бұрын
Awesome
@AadeshGhimire-d7f7 күн бұрын
missed 9 in 1st qn?
@faranahmadk74012 жыл бұрын
thanks :)
@pagovindaraju21476 жыл бұрын
Nice
@anayaz29346 жыл бұрын
your material is very information and your way of teaching is too good . i have some questions related to your topic can u plzzz tell me Why BFS take a lot of space than DFS, although their space complexity is same? and why we implement BFS by only using queue?
@zarwabutt4661
6 жыл бұрын
but sir , we have read that BFS searches breath wise, but when we see this traversing...it seems like random traversing .....
@mohammedayaz8556 жыл бұрын
thank u sir :D
@sinto41054 жыл бұрын
at 3:10 he forgets to add 9 I think
@vinaykumar57914 жыл бұрын
where is 9?
@ravicodes2475 ай бұрын
❤
@amanrubey3 жыл бұрын
dfs is cool
@md.yeahiakhan34157 жыл бұрын
thx
@bluesky_105 жыл бұрын
in bfs 9, you forgot to visit the 9
@hardeepcoder8 жыл бұрын
what's about 9 in bsf ?
@ahmedalrashi8175
7 жыл бұрын
i think he forgot it but it should have been added to the queue
@ayyappachintu7218
6 жыл бұрын
Hardeep Singh 😂😂
@UnBoxerBHAI4 жыл бұрын
SIR THERE IS ONE REQUEST PLEASE SWITCH BACK TO TEACHING ON BOARD AS THOSE VIDEO'S WERE MORE INTRESTING THAN THIS. LOVE YOUR VIDEOS
Пікірлер: 82
Thanks a lot. It was the best material I found about the topic!
@roshansah5155
2 жыл бұрын
Sir now where r u..
Excellent example and comparison i have ever seen. Thanks for this excellent video discussion.
@sinto4105
4 жыл бұрын
at 3:10 he forgets to add 9 I think
Thank you so much sir for clear explanation
you have explained it good but you have forgotten the element 9 in the traversal
Nice explanation... made me clear about different outcomes of BFS and DFS, may Allah bless u!
Great video, thank you very much...
Thanks. It was very useful👌👌
Sir in bfs spanning tree 4 is not connected to 3...???
Are vertex and node same term in graph?
Sir should I consider the alphabetical order.. Only?!
you are the best ever !
Thank you so much!!!
awesome explanation
how can i decide which one go left and which one right
Love you man! Just before xam 😊😊😊😊u killed it
first time i understand it properly
Before starting the 'search', how is the Graph represented for enabling the searching operation ?
@darXer0
3 жыл бұрын
Adjacency Matrix bantaa hai.
effective .. very much effective !!
In the BFS example, why is 9 not in the queue?
Super sir really it was good
Tq sir for ur awesome explanation. Tq sir
please join our university.... we really need professor like you
@raghavgupta6536
3 жыл бұрын
+1
@molyoxide8358
Жыл бұрын
he's already present in KZread University.
Thank You so much
very delicious leacture ty...
@sohamchoulwar1700
4 ай бұрын
Bro, what??
thank you thank you 🥺
Sir ur videos are so helpful throughout the semester. Leraned alot from series of videos.Thank you so much. Sir, plz also consider the Amortized Analysis Chapter and make videos for that also.
@sinto4105
4 жыл бұрын
at 3:10 he forgets to add 9 I think
@sagarjain4128
2 жыл бұрын
@@sinto4105 Yes, He forgot
thanx alot may Allah bless u awesome explanation...
Thank you sir 🙏
Best explaination
bari sir thanks...
Their is mistake in bfs. You did not visited 9 in bfs.
@aaminashaikh778
6 жыл бұрын
mohit pawar yes, not visited 9
@singh_gurjyot
5 жыл бұрын
doesn't matters, because only 3 is adjacent to it, which has already been visited
Well explained
DFS is a graph traversal technique which use 'back tracking' method to visit it previous node.
Can u please make a video on overall dsa content for basic to advance
thank you!
At 3:28 why didn't we put 9 in the queue?
Sir please explain me videos on minimum cost spanning tree by using sollens algorithm sir
sir I m waiting for your next videos.... sir upload please..
addition to not visiting vertex 9, when u made spinning tree, i could not understand....where was the relation between 3 and 4 ? plz answer so that i could overcome my confusion ..
@zarwabutt4661
6 жыл бұрын
sure sir.... its 5:19 ... when we made graph, we see it have a relation b/w 3 and 4 ...but when we made the tree ... what would become of that.... this was the bit of a confusion .... :)
@zarwabutt4661
6 жыл бұрын
thanks alot sir for help :)
Thank u sir
Good lecture
thnx sir ,,,,,,,,,,,,,,,,
Gazab sir
Sir does your Playlist on algorithm complete ??? If it ain't then please complete 8t before 15 of this month..🙏ty for consideration.
@adarsh1360
6 жыл бұрын
We have upcoming end sem from next month plus i have to go for gate prep
@adarsh1360
6 жыл бұрын
You are doing excellent job sir Allah is showing kindness to us through you sir
@adarsh1360
6 жыл бұрын
Nope it's complete. Go for data structure as well sir
There's a mistake. You did not add 9to the queue
thanx :)
thanks
Awesome
missed 9 in 1st qn?
thanks :)
Nice
your material is very information and your way of teaching is too good . i have some questions related to your topic can u plzzz tell me Why BFS take a lot of space than DFS, although their space complexity is same? and why we implement BFS by only using queue?
@zarwabutt4661
6 жыл бұрын
but sir , we have read that BFS searches breath wise, but when we see this traversing...it seems like random traversing .....
thank u sir :D
at 3:10 he forgets to add 9 I think
where is 9?
❤
dfs is cool
thx
in bfs 9, you forgot to visit the 9
what's about 9 in bsf ?
@ahmedalrashi8175
7 жыл бұрын
i think he forgot it but it should have been added to the queue
@ayyappachintu7218
6 жыл бұрын
Hardeep Singh 😂😂
SIR THERE IS ONE REQUEST PLEASE SWITCH BACK TO TEACHING ON BOARD AS THOSE VIDEO'S WERE MORE INTRESTING THAN THIS. LOVE YOUR VIDEOS
5:55
Disliked. Incorrect explanation.
@ashish3saxena
5 жыл бұрын
How?