People are still misunderstanding about this channel creators. Let me clear it out here - Two people started this channel - Animesh and Harsha. Harsha was animesh's mentor and the main content creator and the creator of this video as well is ANIMESH. The other founder Harsha unfortunately passed away in a road accident in 2014. Animesh has stopped making videos because he is doing a regular job now (at google I think). Lastly, this is a rare gem of a channel so we should appreciate this channel and it's content even though the creators are not around anymore :)
Just imagine, if that hadn't happened. He is talking about the upcoming videos like graph algorithms and all sorts of amazing algorithms. Unfortunately, that didn't happen. CS would be a piece of cake with their guidance.
I have tried many books and video lectures for DS and ADA; MIT, Skiena, Coursera[Tim Roughgarden] and what not, nothing worked for me, I was a bit too casual in learning then and those videos couldn't keep me interested. Somehow I found your series and have seen a lot of your playlists and will finish all soon. You sir are a brilliant teacher, perfect in teaching the basic concept, then telling how to improve, limits, edge cases, comparisons with other techniques, videos are neither too long nor too short, and you have even shown us step by step implementation in C/C++. That is just marvelous, I read your blog posts and Quora, and would like to thank you for such an amazing effort for the students and other learners like us. I know you must be very busy with your professional life too but please continue this series whenever you can take out time. :) Thank you once again!
I am replying so late, but I feel the same as you! The ones on the likes of Coursera are so theoretical and methodical, and yet fail to impart the basic knowledge in simple terms. These video series on TH-cam are the best!
@@demigod6190 oh my god. I don't know if I can trust a stranger on the internet but it's just terrible if true. Very few people have the gift of teaching and the will to share their knowledge for free. I hope he's fine wherever he is.
@@VaibhavChauhan08 if you have any trust issues you can check the following link - facebook.com/MyCodeSchool/photos/with-great-sorrow-we-are-having-to-announce-that-harsha-s-co-founder-of-mycodesc/532494763523352/
@@demigod6190 :( Yes I remember Harsha, I always thought the voice in these lessons was of the co-founder, Animesh. Hope he is doing fine in his life. RIP humblefool.
Finally, I reached Graphs after covering other videos of your playlist. I have started DS from zero and your videos made me hero😁😁. You made DS so easy to understand. All credits go to your hard work and teaching style.
You my man are a legend. One of the greatest to do it. You have helped countless amounts of people in their Programming and Computer Science journey and for that, we are forever grateful. Your teachings for Data Structures will live on forever! RIP Harsha Suryanarayana Thank You
This is by far the best video series I have found on this topic. You're concepts are strong and the way you explain in excellent. Most of the vids on graph theory (even the shorter ones ~ 6 - 15 mins) tend to be boring, but not yours. Please complete the series, you will get a lot of subscribers (in other words, even if you may not be doing this for money, you may earn from your vids here).
A really good explanation with very clear graph and text. Thank you for the quality of your video. From now graphs are more clear and affordable than before.
Great work, I am so glad that we have people like you that take the time and effort to provide ivy league college quality content for FREE. and for that we can not THANK YOU enough.
sir,your videos are excellent,though there are many such videos,but none can compete with yours in clarity and simplicity,you don't delve too much into the theory and explains it in simple language,with great examples. If teaching is an art,you are the raja ravi varma of it.
@@bruhhhhbruhhhh He is not killed....His friend who is the founder of mycodeschool, harsha S...is killed....he is animesh nayan is still alive and he is the co-founder of mcs...he stopped making videos because of his job.
why you stopped graph here...please teach...DFS,BFS adjacency list and matrix..problems on strongly connected..graph...I have learnt all the DS and algorithm from your videos only...all videos rock!!..
you're doing a great job..all videos are simply awesome.. books gives us a lot of confusion but when you see it practically , graphically than it looks much easier to grasp thing..excellent and keep it up !!
Should I thank youtube because of which these videos are available or mycodeschool for posting these because there's youtube? The voice, appropriate usage of the examples and the speed of the explanation makes such an imprint in your brain that it's very easy not to forget these concepts later on.
Great video series! It just so happens that I am currently working on a graph CV++ project now and could really use the next video in the series right now!
are you not continuing the video? :( your way of teaching is really one of a kind btw.. really made my life easier. you should make it more complete, maybe make it commercial if that helps (something like CBTNuggets)
I guess in simple path the second example is incorrect.....A,B,F,H,E,B,A,D has vertices and edges repeated .......it must come under trail....correct me if i am wrong
Hello, the example you should on this video at 11:53 stated that the third graph is a strongly connected graph. However, the definition of SCG is "if there is a path from any vertex to any other vertex", and you said a path is a walk with no repetition of vertices and edges. However, the thid graph, let's say we want to find a path from A to B, We can go A->D->B->D->B and there are repetitions of both vertices and edges. So I wonder why is that. Can someone explain?
I'm actually not here to defeat interview questions... I just wanted that out of the way. I'm genuinely interested in graphs, and I hope to implement them in my projects.
SIR,U TEACH THE BEST THROUGH YOUR VIDEOS ..BUT AFTER BINARY TREES WHY U DIDN'T COVER SORTING TECHNIQUES LIKE HEAP SORT, SHELL SORT..THEY ARE ALSO HARD TO UNDERSTAND AND RELATED TO TREES IN SOME WAY ....WILL THEY COME AFTER GRAPHS?? ..... waiting for response curiously!!
Sushank Kumar yes there are videos on basic sorting techniques like bubble,insertion ,selection,merge and quick sorts. but my query was specific to "heaps,heap sorting and shell sorting" its not in the playlist.and i think these are important and somewhat hard to understand and should be taught by you sir cause u teach the best :) :)
this question is beyond the topic but i'll ask anyway, did you build your site? in the case that you built it, is there any chance that you could make a tutorial on how to integrate a pagination/page module such as that in your website? also, did you use some kind of a javascript plugin?
hi sir .firstly,i like to congratulate on the video series.you are too good in explaining difficult concepts. i like to have your suggestion on DATA STRUCTURE BOOKS. please suggest books fr for beginners and intermediate. thanks in advance .
ganesh raj "Introduction to algorithms" by Coremen is good. I do not see any reason to classify on difficulty. Moreover, our playlist on Data structures has covered the subject extensively. If you are able to understand and code all of this, you can follow any book afterwards.
6:40 can't we say that the maximum number of edges in an undirected graph is equal to (n-1)! ? explanation: as the 1st edge can be have (n-1) edges, the 2nd can have ((n-1)-1) edges, the third can have (((n-1)-1)-1) edges that have not been considered.
Well no, see in calculating maximum number of edges we add all the possible edges in the graph (for undirected graph), like so; (N-1) + (N-2) + (N-3) + ...... + 2 + 1 = N*(N-1)/2 what you are doing is multiplying, which is not applicable in this case, but what you need to do is addition. Now for a directed graph you can just multiply the total no. of edges of undirected graph by 2 to obtain the maximum no. of edges, like so; 2*N*(N-1)/2 = N*(N-1)
i'm still waitinf for your new videos for this data structure i hope that you can explain how to represent the graph in memory especially with the Adjacency array(not the matrix Adjacency )
When you are good at something you should always do it for free !!!!! and you are perfect ...Great Video!!!! how much time would you take to complete graphs
This summary was generated by Kol AI. - Graphs are defined as an ordered pair of a set of vertices and a set of edges. - Edges can be directed or undirected, and graphs can be weighted or unweighted. - Special types of edges include self-loops and multi-edges. - It's important to understand whether a graph is dense or sparse. - Understanding paths, cycles, and whether a graph is connected or strongly connected is also important. Like the comment to help others find this summary!
People are still misunderstanding about this channel creators. Let me clear it out here - Two people started this channel - Animesh and Harsha. Harsha was animesh's mentor and the main content creator and the creator of this video as well is ANIMESH. The other founder Harsha unfortunately passed away in a road accident in 2014. Animesh has stopped making videos because he is doing a regular job now (at google I think). Lastly, this is a rare gem of a channel so we should appreciate this channel and it's content even though the creators are not around anymore :)
Sorry for Harsha
Sorry. RIP Harsha and thank you!
Just imagine, if that hadn't happened. He is talking about the upcoming videos like graph algorithms and all sorts of amazing algorithms. Unfortunately, that didn't happen. CS would be a piece of cake with their guidance.
@@ShawnDypxz This is really sad
The explanations in this video are fantastic. You have a gift for explaining computer science topics clearly. Thank you.
I have tried many books and video lectures for DS and ADA; MIT, Skiena, Coursera[Tim Roughgarden] and what not, nothing worked for me, I was a bit too casual in learning then and those videos couldn't keep me interested.
Somehow I found your series and have seen a lot of your playlists and will finish all soon. You sir are a brilliant teacher, perfect in teaching the basic concept, then telling how to improve, limits, edge cases, comparisons with other techniques, videos are neither too long nor too short, and you have even shown us step by step implementation in C/C++. That is just marvelous, I read your blog posts and Quora, and would like to thank you for such an amazing effort for the students and other learners like us. I know you must be very busy with your professional life too but please continue this series whenever you can take out time. :)
Thank you once again!
I am replying so late, but I feel the same as you! The ones on the likes of Coursera are so theoretical and methodical, and yet fail to impart the basic knowledge in simple terms. These video series on TH-cam are the best!
he is no more. missed him a lot! :(
@@demigod6190 oh my god. I don't know if I can trust a stranger on the internet but it's just terrible if true. Very few people have the gift of teaching and the will to share their knowledge for free. I hope he's fine wherever he is.
@@VaibhavChauhan08 if you have any trust issues you can check the following link - facebook.com/MyCodeSchool/photos/with-great-sorrow-we-are-having-to-announce-that-harsha-s-co-founder-of-mycodesc/532494763523352/
@@demigod6190 :( Yes I remember Harsha, I always thought the voice in these lessons was of the co-founder, Animesh. Hope he is doing fine in his life. RIP humblefool.
Finally, I reached Graphs after covering other videos of your playlist. I have started DS from zero and your videos made me hero😁😁. You made DS so easy to understand. All credits go to your hard work and teaching style.
You my man are a legend. One of the greatest to do it. You have helped countless amounts of people in their Programming and Computer Science journey and for that, we are forever grateful.
Your teachings for Data Structures will live on forever!
RIP Harsha Suryanarayana
Thank You
Come back please. The world needs your teaching. You are a blessing to the Cs learners. Please come back !
he died
This is by far the best video series I have found on this topic. You're concepts are strong and the way you explain in excellent. Most of the vids on graph theory (even the shorter ones ~ 6 - 15 mins) tend to be boring, but not yours. Please complete the series, you will get a lot of subscribers (in other words, even if you may not be doing this for money, you may earn from your vids here).
*your
Worth to watch it, I wasted my 2 hours to search about graph theory then finally found your video, really helpful..thanks a lot..🙏
A really good explanation with very clear graph and text. Thank you for the quality of your video. From now graphs are more clear and affordable than before.
Great work, I am so glad that we have people like you that take the time and effort to provide ivy league college quality content for FREE. and for that we can not THANK YOU enough.
He was as GSOC Finalist and TOC Finalist. Unfortunately he is no more. He left us in an car accident. It was a hit and run case. May his soul RIP.
sir,your videos are excellent,though there are many such videos,but none can compete with yours in clarity and simplicity,you don't delve too much into the theory and explains it in simple language,with great examples. If teaching is an art,you are the raja ravi varma of it.
Best online teacher of computer science, bar none.
ur really good at what you do.. seriosly, everything I have learned in data structure this semester is from your tutorials. thanks man.
while(1)
{
cout
Syntax error.....
As no header file is included....
Dont forget the " " for your string lol
Compliler kindly says
Error: identifier Thank is undefined
@@travelswithanmol wow this is worse than being grammar nazi, this is syntax nazi!!
std::cout
One of the best explanation in entire youtube.
awesome.. waiting for more on graphs with clear implementation details..because that's where graphs are headache for me
7:20 - Dense & Sparse Graphics
7:49 - storage structure: Adjacency matrix (Dense graph) and Adjacency List (Sparse graph)
7:52 - Decision (storage) basing on graph is dense/sparse
9:40 - Path, Talk Trail
Rip man, you were a great soul.
what happned??
@@KeshariPiyush24 The dude got killed by a car couple years ago
@@bruhhhhbruhhhh He is not killed....His friend who is the founder of mycodeschool, harsha S...is killed....he is animesh nayan is still alive and he is the co-founder of mcs...he stopped making videos because of his job.
@@Unknown-Stranger Oh alright thanks for shedding some light i was unaware of that.
Excellent clarity, very rare to see this . Thanks a lot. I have been struggling with graphs. You made it so simple
why you stopped graph here...please teach...DFS,BFS adjacency list and matrix..problems on strongly connected..graph...I have learnt all the DS and algorithm from your videos only...all videos rock!!..
@@akashgoyal6276 if u got some course pls share with me bro..Thanks
just one word - Awesome . Please share the link of your videos on various DS problems , System design and Scalability that are asked in Interviews.
Thank you for posting these clear and concise lectures, these are very helpful.
Excellent way of explaining 👍
Just checked out your channel as well. You are doing a good job.
you're doing a great job..all videos are simply awesome..
books gives us a lot of confusion but when you see it practically , graphically than it looks much easier to grasp thing..excellent and keep it up !!
Happy teacher's day.😀
I really like your way of explanation to each data structure. I feel data structure is easy if I liesten to your explanation.
Thanks for the vedio
You have a way of explaining things very neatly. Thank you so much and keep up the good work.
your tutorials are d best ever...keep uploading new videos..Good Luck..!!
Should I thank youtube because of which these videos are available or mycodeschool for posting these because there's youtube?
The voice, appropriate usage of the examples and the speed of the explanation makes such an imprint in your brain that it's very easy not to forget these concepts later on.
you are the legend. MVP of cs
I really like your videos, please continue making them! BTW, can you cover heap in data structure as well?
Error.....
As no header file is included....
SYNTAX ERROR
just keep on the good work dude.ur tutorials are d best :)
At 11.14 graph is still not strongly connected because A to C is not directly connected like B to D. Am I correct?
Yeah, C to A is not connected
Nice explanation ❤️
🔥
Great video series! It just so happens that I am currently working on a graph CV++ project now and could really use the next video in the series right now!
thank you so much sir for all the data structure videos ... your videos are best to very easiy understandable..
Perfect explanation, helped a lot
are you not continuing the video? :( your way of teaching is really one of a kind btw.. really made my life easier. you should make it more complete, maybe make it commercial if that helps (something like CBTNuggets)
Perfect..just perfect. Can't wait for other videos
These videos on data structures are pretty good. thumbs up
Are you going to update the series?I hope you continue doing it,because your tutorial is so great!
Don't you know the founder of the channel is passed away in 2014
I guess in simple path the second example is incorrect.....A,B,F,H,E,B,A,D has vertices and edges repeated .......it must come under trail....correct me if i am wrong
Such a great video. Would be great if you can cover heaps in data structures as well,
Saivarshini Ravi hackerrank has decent video on it
please update your series . I am hungry for more .BTW too good and thanks for uploading such treasure .Looking for more videos soon
Hello, the example you should on this video at 11:53 stated that the third graph is a strongly connected graph. However, the definition of SCG is "if there is a path from any vertex to any other vertex", and you said a path is a walk with no repetition of vertices and edges. However, the thid graph, let's say we want to find a path from A to B, We can go
A->D->B->D->B and there are repetitions of both vertices and edges. So I wonder why is that. Can someone explain?
If you want to go from A to B, you go A - D - B and stop there (because you have reached B). No repetition.
2:00 - I laughed so hard when you said you're gonna teach it anyway
Best lecturer
Many thanks for uploading these treasuries videos. Please try to complete Graphs.
Why is your website not opening?
sir ur explanation is superbbb
do you videos on java??
Great explanation, thanks for making this series.
Great works with microscopical explanation.
I just miss your videos sir. You are god. #respect
thank you i hope that you can continue to the advanced courses in graph
Am I missing something? At 11:39 , there is no path from A to C, so how is it a strongly connected graph?
You're an amazing teacher.
This is so clear!! Thanks a ton for these videos
I'm actually not here to defeat interview questions... I just wanted that out of the way. I'm genuinely interested in graphs, and I hope to implement them in my projects.
Superb explanation
Thank you so much for this, good Sir.
SIR,U TEACH THE BEST THROUGH YOUR VIDEOS ..BUT AFTER BINARY TREES WHY U DIDN'T COVER SORTING TECHNIQUES LIKE HEAP SORT, SHELL SORT..THEY ARE ALSO HARD TO UNDERSTAND AND RELATED TO TREES IN SOME WAY ....WILL THEY COME AFTER GRAPHS??
.....
waiting for response curiously!!
Sushank Kumar yes there are videos on basic sorting techniques like bubble,insertion ,selection,merge and quick sorts.
but my query was specific to "heaps,heap sorting and shell sorting"
its not in the playlist.and i think these are important and somewhat hard to understand
and should be taught by you sir
cause u teach the best :) :)
+Shashwat Srivastav Coursera.org courses on algorithm part 1 is pretty good explanation for these things. He has visualization in his lecture video.
Love from Bangladesh
Really good explanation. Is there any plan to put more videos on graph? If so, when can we expect?
it's just as perfect as always
Sir, www.mycodeschool.com/videos/ is not accessible. It says 502 bad gateway "
ginx/1.1.19
are you planning to do any videos on hashing? it would be really nice to have them.
Excellent explanation.
Two Words-->Thank You!!!
Keep up the good work sir, ur awesome!
I think we can have a path with repeating vertices and non-repeating edges?
this question is beyond the topic but i'll ask anyway, did you build your site? in the case that you built it, is there any chance that you could make a tutorial on how to integrate a pagination/page module such as that in your website? also, did you use some kind of a javascript plugin?
Thanks for excellent explanation.
when are we having the next graph videos? :) it would be nice to learn the implementation of it!
thank u bro for such an amazing concepts
Excellent video! Very informative
Please do some videos on DP. How to think in terms of overlapping sub problems and optimal sub structure.
How to build intuition of the solution
amazing explanation.
In sparse graph whether the number edges can be less than the number of vertices?( like an edge with two vertices )
Suresh D.Naik Of course... if the edges are too few, the graph is sparse. You should just take the literal meaning.
mycodeschool
thank you, this the best that I found on youtube
hi sir .firstly,i like to congratulate on the video series.you are too good in explaining difficult concepts.
i like to have your suggestion on DATA STRUCTURE BOOKS.
please suggest books fr
for beginners and
intermediate.
thanks in advance .
ganesh raj "Introduction to algorithms" by Coremen is good. I do not see any reason to classify on difficulty. Moreover, our playlist on Data structures has covered the subject extensively. If you are able to understand and code all of this, you can follow any book afterwards.
mycodeschool thank you for your suggestion.
A Graph Can be both Directed and Undirected at the same time ?
6:40
can't we say that the maximum number of edges in an undirected graph is equal to (n-1)! ?
explanation:
as the 1st edge can be have (n-1) edges, the 2nd can have ((n-1)-1) edges, the third can have (((n-1)-1)-1) edges that have not been considered.
Well no, see in calculating maximum number of edges we add all the possible edges in the graph (for undirected graph), like so;
(N-1) + (N-2) + (N-3) + ...... + 2 + 1 = N*(N-1)/2
what you are doing is multiplying, which is not applicable in this case, but what you need to do is addition.
Now for a directed graph you can just multiply the total no. of edges of undirected graph by 2 to obtain the maximum no. of edges, like so;
2*N*(N-1)/2 = N*(N-1)
explanation is good keep going on sir
he's no more
Hi sir, don't you have a plan to make lessons on Heap sorting ?
Which writing pad do you use for your tutorials? :)
Is there a next lesson after this on Graphs ??
I was not able to find the next lesson ....Plz help !!!
i'm still waitinf for your new videos for this data structure i hope that you can explain how to represent the graph in memory especially with the Adjacency array(not the matrix Adjacency )
at 11:10 he meant any vertex to EVERY other vertex... in definition. Reply to this if i am wrong.
When you are good at something you should always do it for free !!!!! and you are perfect ...Great Video!!!!
how much time would you take to complete graphs
Simply amazing
Very good. Thanks!
This summary was generated by Kol AI.
- Graphs are defined as an ordered pair of a set of vertices and a set of edges.
- Edges can be directed or undirected, and graphs can be weighted or unweighted.
- Special types of edges include self-loops and multi-edges.
- It's important to understand whether a graph is dense or sparse.
- Understanding paths, cycles, and whether a graph is connected or strongly connected is also important.
Like the comment to help others find this summary!
great video!
Where graph traversal (BFS, DFS) ?
nice explaination i like it
You are the best!
It is really nice to use the subtitles but it's bothering the lower part of the board .. can't see what's written
I need a vedio on radix sort plzzzzzzzz
he's no more
?
You are awesome!
you are a hero
was.he died
Nice video....
sir
i need tutorials of algorithm course for next semester
can you please help?