I was unable to take admission to an engineering college to pursue Software Engineering due to my financial conditions. But I never lost hope I am studying on my own self and I feel privileged that I came to know about your channel. Thank you so much for such valuable content.
I am a self-taught software developer with an established career. you can do this too. university is not required. the best advice to all readers is to start with web dev because it is the easiest path to starting a career. then on your own time study CS and interesting problems - because of this you will gain a fabulous education and your career will advance. good luck Ali Farhan
I am an autodidact Data Scientist, i started with Web development and i did everything using only google, no school. You can do it but you need to be 10 times better than the others may god help you in your journey.
4 years into software engineering and had to refresh the knowdlegd on this. SO far the best explanation of such complex and abstract for many topic graphs. A true GEM video. Thanks!
This is by far the best video regarding graph theory I have seen in my (quite long) life. Extremely clear, extremely accurate and extremely useful. As "Einstein Newton" here said 8 months ago, this can be considered the 3Blue1Brown of Computer Science. Congratulations!
u are just the goat of cs explanation! the soothing bg music has made the video just wow! important is that investing just 16 minutes and learnt it all - about graphs is more than enough.......thank u very much Mr.x (as I don't ur name)
There is a small mistake at 4:15 You would need to connect every point on a column with every other point on the same column same for the rows. Otherwise a graph coloring algorithm wouldn't work here, since graph coloring algorithms only test for the constraint that each neightbor has a different color.
I'm studying by myself and I can tell this video has helped me a lot, not only due to the perfect explanation but also because of the downright great representations of what was being said. Thank you a lot, your work has been helping a lot of people!
Your videos are absolutely amazing ! Especially your recursion video helped me immensely. Looking forward to more of your work. Keep going, this channel is going to be big! The video quality is just soo goood.
An application of Graph theory in field of Pharmaceutical sciences is "Network Pharmacology". A software named Cytoscape is used to construct networks displaying connections between drugs, targets and diseases. This video reminded me of this and now this whole concept has become more interesting.
Never seen a solution to a sodoku with graph theory! I just learned this to prepare for some competetive programming, I knew it was possible to solve using some disgusting nested for loops, but never knew graph would be a solution. Thank you!
I like the little bit at the end regarding the path through each vertex only once. Welcome to graph theory 101. After some foundational examples let's jump straight to proving that P=NP. lol
Imagine Every Single Teacher in The World Teach Like HIM!! I mean there is no Teacher in my College who teach like him. His Explanations are clear and the way he presents his presentation is easy to understand and not boring to watch.
Im just can't thank you enough, this video was so enlightening that actually gives me a hope, it proves that I am able to learn and understand hard concept w/o expensive education. Eventually I would become a programmer. Thank you from the bottom of my heart
Dude the way of explained this topic is so amazing and you made it look so easy to understand, It is so hard to understand this topic from books for someone like me. Thanks alot for your help. GOD bless!!
If everyone was like you, study wouldn't not be tough. Thank you for this video and graph theory explanation. What you made is not just knowledge, but enlightment for me. You do it like its a cake to you, and I actually understand your explanation.
I love the mission of this channel! We need more interesting ways to delve into computer science for people who don’t want to sit down for 2 hours to understand fundamental (often complex) computer science topics!!! KEEP UP THE GOOD WORK!
I spent a few hours building a Graph data type in Haskell (and I do not remember why), and how I did it was as a (cyclic) list of pairs, where the first entry is the node value, and the second is a list of offsets of the node's neighbors. For example, it would represent the graph at 12:38 as [(0, [1,2,3]), (1, [4, 2]), (2, [3, 1]), (3, [2, 3, 4, 1]), (4, [4])]
thank you SO MUCH for always providing representation of everything in terms of data structures. this is a differences between a topic being complete jargon and an actually making practical sense
10:35 This matrix can be reduced to about half the size, since it is mirrored along the [(0,0), (4,4)] line, so either side of that line can be removed. (Depending on what's being graphed, you might want to either keep or remove the entries along that diagonal line).
@@alfredtomey in most Object-Oriented languages and any language that supports direct memory access, you can have an array of pointers, each pointer going to an array with its own length. Even if the language doesn't support direct memory access or objects, if it supports arrays one could emulate direct memory access. so, the answer is that every programming language that supports any kind of list whatsoever is capable of such an array.
Thank you for this video, I’ve been having a hard time motivating myself to start studying the graph theory chapter for my discrete math class, and this has helped me to finally open my textbook!
I'm so happy I got here. I'm a completely new to all of this yet I cam out understanding every single thing you just said. That was amazing. Thsnk you so much
Man!... your animations blow my mind 🤯 brilliantissime!!! Please keep doing them. I spent a moment on YT to find something understandable about graphs... and I found you! Thank you very much 🙏🏻🙏🏻
Amazing Explanation !! You explained such a complex topic in so easy to understand language. I learnt a lot today and also found out interesting ways to visualize a graph. Thank you !!!
This was your first video that i saw amd let me say I'll always come here whenever there'll be a new math concept in CS that i want to understand. Cheers👍
What an amazing video. I am about to take graph theory next semester, your video absolutely makes my hope high for that course now. Keep the good work, hope the channel to get more attention in the future. P.s: Is that possible if you can give a link to the script of the video or the summarize of what you talk about in the video. It will become a super helpful study material.
Thanks for the wonderful comment, I really appreciate it! That's an interesting idea, l think the easiest solution would be adding text files for scripts into the linked Github under a new folder. I'll try to remember to do that when the next video comes out (should be in 1 - 2 weeks). I will warn you, however, the scripts have a ton of notes on them about random animation files and things I need to remember when editing it all together that I probably won't have time to go back through and remove, so by no means will it be the cleanest "video script." Hope that's alright haha.
Your video made me love the graphs. Thank you. Now I will look more into graphs, My friends find it difficulty but let me try it then we will find out.
The video is very, very good! Thanks for all the work that went into making it. As a side note, I'd suggest you drop the background music as it makes harder to focus on the explanations.
7:00 question about cycles. Lets say I went from 4 to 1 to 0. But then I went up to 3, and back to 1 then to 4. Would that be a cycle? Or does the overlap at 1 make it not a cycle?
I can not believe that I found and used the adjacency list by myself some time ago in a sketch without knowing it is a thing. I think it is the proof that the adjacency list is the most usefull representation
3Blue1Brown of Computer Science. Brilliant video.
Absolutely.
When I was watching this I thought hmm why does 3B1B's voice sound different
haha even i thought so
Absolutely Brother. Such nice content in this vast ocean of copy cat junks.
@@KonigKlack They are. He gives credit in the notes below the video.
I was unable to take admission to an engineering college to pursue Software Engineering due to my financial conditions. But I never lost hope I am studying on my own self and I feel privileged that I came to know about your channel. Thank you so much for such valuable content.
Are you indian or paki?
I wish you success
@@harrykekgmail I wish you too :)
I am a self-taught software developer with an established career. you can do this too. university is not required. the best advice to all readers is to start with web dev because it is the easiest path to starting a career. then on your own time study CS and interesting problems - because of this you will gain a fabulous education and your career will advance.
good luck Ali Farhan
I am an autodidact Data Scientist, i started with Web development and i did everything using only google, no school. You can do it but you need to be 10 times better than the others may god help you in your journey.
4 years into software engineering and had to refresh the knowdlegd on this. SO far the best explanation of such complex and abstract for many topic graphs. A true GEM video. Thanks!
Introduction :- 0:00
Why Study Graph :- 1:33
Definition :- 4:35
Terminologies :- 5:22
Types of Graph :- 8:32
Representation :- 10:15
Graph Problems :- 12:44
Pro-tip: if you put the timestamps on the left, they'll line up better.
This is by far the best video regarding graph theory I have seen in my (quite long) life. Extremely clear, extremely accurate and extremely useful. As "Einstein Newton" here said 8 months ago, this can be considered the 3Blue1Brown of Computer Science. Congratulations!
I was about to say that!
This is a great channel, definitely will get much more recognitions in the future!
I'm from the future! You were right. Just discovered this channel and I love it.
It's happening
I agree :)
I am from far future
Just found this, from the farer future
I think it is the best video on UA-cam that discuss and give an existing introduction about graph theory. It was my duty to thank you for this video!
u are just the goat of cs explanation! the soothing bg music has made the video just wow! important is that investing just 16 minutes and learnt it all - about graphs is more than enough.......thank u very much Mr.x (as I don't ur name)
This is going to be one of the most popular study channel in the future ♥️
There is a small mistake at 4:15
You would need to connect every point on a column with every other point on the same column same for the rows. Otherwise a graph coloring algorithm wouldn't work here, since graph coloring algorithms only test for the constraint that each neightbor has a different color.
I'm studying by myself and I can tell this video has helped me a lot, not only due to the perfect explanation but also because of the downright great representations of what was being said. Thank you a lot, your work has been helping a lot of people!
Your videos are absolutely amazing ! Especially your recursion video helped me immensely. Looking forward to more of your work. Keep going, this channel is going to be big! The video quality is just soo goood.
Thank you! Glad you find these videos helpful and yup I have so many ideas for content so don't plan on stopping any time soon :)
An application of Graph theory in field of Pharmaceutical sciences is "Network Pharmacology". A software named Cytoscape is used to construct networks displaying connections between drugs, targets and diseases. This video reminded me of this and now this whole concept has become more interesting.
Never seen a solution to a sodoku with graph theory! I just learned this to prepare for some competetive programming, I knew it was possible to solve using some disgusting nested for loops, but never knew graph would be a solution. Thank you!
I like the little bit at the end regarding the path through each vertex only once.
Welcome to graph theory 101. After some foundational examples let's jump straight to proving that P=NP. lol
wow never would've thought about sudoku like this - that's awesome!
Imagine Every Single Teacher in The World Teach Like HIM!! I mean there is no Teacher in my College who teach like him. His Explanations are clear and the way he presents his presentation is easy to understand and not boring to watch.
well, I presume no teacher has a couple of weeks/months time to prepare a single lecture that introduces basic concepts
Im just can't thank you enough, this video was so enlightening that actually gives me a hope, it proves that I am able to learn and understand hard concept w/o expensive education. Eventually I would become a programmer.
Thank you from the bottom of my heart
Beautifully explained and easily understandable to someone who knows little to nothing about graph theory or computer science. Keep up the good work!
Dude the way of explained this topic is so amazing and you made it look so easy to understand, It is so hard to understand this topic from books for someone like me. Thanks alot for your help. GOD bless!!
If everyone was like you, study wouldn't not be tough. Thank you for this video and graph theory explanation. What you made is not just knowledge, but enlightment for me. You do it like its a cake to you, and I actually understand your explanation.
As a network engineer, this is really interesting! I visualize my networks with python and networkx and dot-graphs. Really fun!
I love the mission of this channel! We need more interesting ways to delve into computer science for people who don’t want to sit down for 2 hours to understand fundamental (often complex) computer science topics!!! KEEP UP THE GOOD WORK!
hats off, the production quality is mind boggling.
I spent a few hours building a Graph data type in Haskell (and I do not remember why), and how I did it was as a (cyclic) list of pairs, where the first entry is the node value, and the second is a list of offsets of the node's neighbors. For example, it would represent the graph at 12:38 as [(0, [1,2,3]), (1, [4, 2]), (2, [3, 1]), (3, [2, 3, 4, 1]), (4, [4])]
thank you SO MUCH for always providing representation of everything in terms of data structures. this is a differences between a topic being complete jargon and an actually making practical sense
this video is oddly beautiful, i absolutely despised this whole semester of discrete math but you kinda got me invested
This was GREAT! I'm boning up on graph theory for cheminformatics, and this is providing a great foundation!
This is amazing! Reminded me of Vector Art, Wave Function Collapse, and Neuronets a lot.
I have learned a lot, and deffinately want to learn way more!
The amount of time and care taken to produce this video shows. This is my first time on this channel and i'm looking forward to going through it more.
10:35 This matrix can be reduced to about half the size, since it is mirrored along the [(0,0), (4,4)] line, so either side of that line can be removed.
(Depending on what's being graphed, you might want to either keep or remove the entries along that diagonal line).
Is there any programming language that lets you declare a “half-array”? If not, although you’re right, your RAM will be wasted anyway.
@@alfredtomey in most Object-Oriented languages and any language that supports direct memory access, you can have an array of pointers, each pointer going to an array with its own length. Even if the language doesn't support direct memory access or objects, if it supports arrays one could emulate direct memory access.
so, the answer is that every programming language that supports any kind of list whatsoever is capable of such an array.
this video was better than most videos on youtube related to graphs
Just discovered your channel. I'm about to binge everything you've made.
Keep on going! Your channel is just amazing! (Watching from France)
i wish anyone who has interest in Graph, Watch this, the very first Day. Great Work, Thanks!!!!
I came here because of 3B1B, please keep up the good work. You've got great potential.
Thank you for this video, I’ve been having a hard time motivating myself to start studying the graph theory chapter for my discrete math class, and this has helped me to finally open my textbook!
What a clean video anyone can understand from images itself
Thanks a lot for this
I'm so happy I got here. I'm a completely new to all of this yet I cam out understanding every single thing you just said. That was amazing. Thsnk you so much
Man!... your animations blow my mind 🤯 brilliantissime!!! Please keep doing them. I spent a moment on YT to find something understandable about graphs... and I found you! Thank you very much 🙏🏻🙏🏻
Amazing Explanation !! You explained such a complex topic in so easy to understand language. I learnt a lot today and also found out interesting ways to visualize a graph. Thank you !!!
Explain theories with clear diagrams and clear pronunciation. Great !
Superb breakdown of the subject. Had no idea before the video and now I really understand if fundamentally.
Great Introduction to Graph Theory. Amazing Explanation.
This was your first video that i saw amd let me say I'll always come here whenever there'll be a new math concept in CS that i want to understand.
Cheers👍
Taking this as a grad level course rn. Its very stimulating for visual learners
You need content.
Binge watchable sets of 20+ min videos on related topics from video to video.
Trust the community.
Keep it up great job.
Brilliantly explained the concept of graph theory. Thank you.
As a CS student this is really good content. Love all the videos you make!
Another great one. Can’ t wait for more:)
Your videos are so well explained. Wish i had a teacher like you from high school...
At 5:06, a small mistake: you should have writeen V = {0, 1, 2, 3, 4} and not V = {0, 1, 2, 3, 4, 5}
Very nicely presented, clear and concise. You are the great teacher.
Great video. Simple and easy to understand, and yet it gives a great overview of graph theory concepts.
What an amazing video. I am about to take graph theory next semester, your video absolutely makes my hope high for that course now. Keep the good work, hope the channel to get more attention in the future.
P.s: Is that possible if you can give a link to the script of the video or the summarize of what you talk about in the video. It will become a super helpful study material.
Thanks for the wonderful comment, I really appreciate it!
That's an interesting idea, l think the easiest solution would be adding text files for scripts into the linked Github under a new folder. I'll try to remember to do that when the next video comes out (should be in 1 - 2 weeks).
I will warn you, however, the scripts have a ton of notes on them about random animation files and things I need to remember when editing it all together that I probably won't have time to go back through and remove, so by no means will it be the cleanest "video script." Hope that's alright haha.
Your video made me love the graphs. Thank you. Now I will look more into graphs, My friends find it difficulty but let me try it then we will find out.
Why didnt i find this channel sooner? Love this
I will sit and watch all your videos one by one
The sudoku Example was the best! Please make more videos on graph theory
i cant read my college material for this particualr topic and found your videos, ist really great!!
2:53 Ironically I thought Sudoku would be the first example lmao, but well played
It feels so great that Grant has inspired people to follow this cool way of explaining things, keep up !!!
Great explanation😊
Please keep up these sensational videos, incredible amount of work and effort gone into these!
very good video, thank you so much, keep up the good work, watching 2 days before an exam
Thank you, I don't think I really understood adjacency lists until I watched this video.
Brilliant elegant explanation, wow. Thank you one thousand times !
The Sudoku example is outstanding and useful.
Very nicely introduced, I hope you have some very complex cutting edge applications of graph theory to show off :)
Thanks a lot for this video, I’ve really enjoyed it. I wish our lecturers were explaining it like you did 😢
Wow!! Amazing Video. One the best video, I have ever seen.
The video is very, very good! Thanks for all the work that went into making it. As a side note, I'd suggest you drop the background music as it makes harder to focus on the explanations.
7:00 question about cycles. Lets say I went from 4 to 1 to 0. But then I went up to 3, and back to 1 then to 4. Would that be a cycle? Or does the overlap at 1 make it not a cycle?
Currently in an Algorithms and Data Structures class at my college. Man i love graphs
3:48 the connection line between top mid circle to bottom left circle is missing, and due to copy-paste it translated further....
I can not believe that I found and used the adjacency list by myself some time ago in a sketch without knowing it is a thing. I think it is the proof that the adjacency list is the most usefull representation
the music was a very good touch to this video
10:10 If a graph is connected and undirected doesn't adding an edge *always* create a cycle?
Great video !!! It Accomplish his goal of giving an introduction on the topic.
Thnk u so much this breakdown hs helped me pass my exams ❤
absolutely amazing explanation!
I love the experience or watching the video!,
So immersive. and the content is kinda wholistic,
Thank you so much!
Just found you channel through this video. Great presentation.
I love this style of video.
very nice, thanks for the vizualisation and soothing music
Awesome video! Can't wait to see more videos like this being posted!
Wow, so glad I found this channel. Subbed.
Thank you , definitely gave me some understanding in short time
Fantastic, just needed info for programming.Thank you.
Please make more content on Graphs!!
best video for introduction to graphs....
Thank you for existing!
No of edges is same as number of neighbors has helped me to understand related topics in terms of visualizing, thanks!
nice channel i just found it today, i like the concise summary's of topics
Beautifully explained. Thank you!
Thank you for putting subtitles
Excellent Channel and very informative with rigor.
Simply awesome ! keep the good work going 👍
Brilliant video. are there any recommendation on learning resources you can suggest while we wait for the next in the series?
Am I missing something or is there a missing edge from the top blue node to the bottom left node in the graph shown at 3:45?