5:50 I was confused as to how removing an edge could increase the number of connected components, but remember "connected components" just means the number of connected subgraphs that aren't connected to eachother
As what your definition of connected components says, one island becomes, say, three islands when removing bridges. Therefore, the number of islands increases?
@@BruinChang for me, it's easier to view the graph as a blueprint of a one-story building, where the edges are corridors & the nodes are doors. let's say I decide to block door X. if doing so increases the number of distinct (disconnected) corridors, I call it an articulation point.
Thank you this is very helpful for me, I started studying graphs yesterday and couldn't find a good source with good order. Either it was overloaded or had stopped till bfs dfs
I was exploring your codes on github.I was curious if you will cover number theoretic algorithms (didn't mean to bother you ,it's just there are scarce resources relating to numbers).
Thanks for the great video. Just one remark/question about your statement on the TSP: In my understanding ant-colony optimization is a meta-heuristic approach. Classic approximation algorithms are rather a fixed procedure (no iteration steps) with a proven worst-case-ratio. Would you say there is no difference?
That's the idea in case someone actually wants to implement in real code. I usually provide code anyways, but providing pythonish pseudo code should be very understandable
salesman comes from patriarchy... that's why he said 'salesperson'... educate yourself before speaking soemthing........ ok so i was spouting nonsense.😅 plz don't get offended.
I came through a problem where I needed to find the points in a grid that are at the shortest distance from all other points in a grid. please suggest the solution
![일상 속 기분 좋음 [Proto disco meme]](http://i.ytimg.com/vi/DwmEIaZ7XGQ/mqdefault.jpg)
![⭐ฮิตในTikTok!! ( มะมะมะหมูเด้ง MooDeng ) Ver. แดนซ์ ReMix BY [ ดีเจกิต รีมิกซ์ ]](http://i.ytimg.com/vi/4noyAoMa7bQ/mqdefault.jpg)
dude how are you not popular? probably the most lucid channel for learning stuff! thanks for sharing your knowledge!!
agree!!
I'd say the monotone voice is one of the reasons he is not popular.
I can barely bear with it, but otherwise it is great content
Thanks for posting this series on Graph Theory, I am finding it very useful!
Only 30k views break my heart : (
Anyway, I will share this playlist with my best friends.
5:50 I was confused as to how removing an edge could increase the number of connected components, but remember "connected components" just means the number of connected subgraphs that aren't connected to eachother
thanks bro, i was having the same confusion
As what your definition of connected components says, one island becomes, say, three islands when removing bridges. Therefore, the number of islands increases?
@@BruinChang for me, it's easier to view the graph as a blueprint of a one-story building, where the edges are corridors & the nodes are doors. let's say I decide to block door X. if doing so increases the number of distinct (disconnected) corridors, I call it an articulation point.
thanks, man. i was having the same problem in my head. now it's gone!
Thanks man. This video really opens my eyes on how useful graph theory can be.
it's hard to reach the end, you know. I still love it. So many knowledge
Golden Standards for teaching! Great work man!
Really great work. Appreciate this series and its emphasis. Thank you so much.
Thank you this is very helpful for me, I started studying graphs yesterday and couldn't find a good source with good order. Either it was overloaded or had stopped till bfs dfs
Thank you for your effort, very professional and scientific information with a clam rythm. Great Job
Thanks for the Video. I really like it, because you are stating problems, which can be solved by those algorithms. You also explain it well.
William... I LOVE YOU MAN !!!
Very nice! another useful graph problem: Minimum cuts(ex: Karger's algorithm)
will you cover advance graph algorithms like Heavy Light Decomposition ?
Thanks anyways.These videos deserve more views.
It's on my radar, I just need to find a way to fit it into the series.
I was exploring your codes on github.I was curious if you will cover number theoretic algorithms (didn't mean to bother you ,it's just there are scarce resources relating to numbers).
Perhaps eventually, but for now it would only be one off videos if I ever did that.
Great video!!! Simply awesome and best content . Thank you for sharing this
In 1:51 the graph can be unweighted also not only weighted. This is a typing problem on the slide
Thank you for this. It helps infinitely
Great Job! Keep it up. Thanks.
Very much helpful video. keep uploading more and more videos.
Thanks for the great video. Just one remark/question about your statement on the TSP: In my understanding ant-colony optimization is a meta-heuristic approach. Classic approximation algorithms are rather a fixed procedure (no iteration steps) with a proven worst-case-ratio. Would you say there is no difference?
Amazing series!
1:17 : find the shortest way from A to H (not B)
Yeah, He spoke B instead of H by mistake.
Love from S Korea
I like this video very Much!
Great playlist
wow man!! you are awesome 🎉 Thanks
you are the best, thank you
At 1:10, shouldn't the description say from node A to node H?
Yes that's correct, there's a mistake
This pseudocode looks like Python. Great playlist.
That's the idea in case someone actually wants to implement in real code. I usually provide code anyways, but providing pythonish pseudo code should be very understandable
I haven't heard of the traveling salesperson problem; however, I have heard of the traveling salesman problem.
salesman comes from patriarchy... that's why he said 'salesperson'... educate yourself before speaking soemthing........
ok so i was spouting nonsense.😅 plz don't get offended.
Did you find it difficult to pronounce Kosaraju's name?
I came through a problem where I needed to find the points in a grid that are at the shortest distance from all other points in a grid. please suggest the solution
i am lost at trees with cycle meaning
please make mathematics video series covering various algorithms
I am in grade5 and it makes me fly
Thank you William god gave you a very bright mind consider reading about islam brother
Dai punda pundya mudiku class ku poda
Maybe some network motif/ network matching problems? A ton of NP-Hard problems. Search: community search.