Overview of algorithms in Graph Theory

[@vcfirefox]

dude how are you not popular? probably the most lucid channel for learning stuff! thanks for sharing your knowledge!!

[@codewithbug]

agree!!

[@arjix8738]

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

[@ulissemini5492]

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

[@papastalin1543]

thanks bro, i was having the same confusion

[@BruinChang]

As what your definition of connected components says, one island becomes, say, three islands when removing bridges. Therefore, the number of islands increases?

[@carmelbaris7088]

@@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.

[@codewithbug]

thanks, man. i was having the same problem in my head. now it's gone!

[@rohiteshjain6884]

Only 30k views break my heart : ( Anyway, I will share this playlist with my best friends.

[@amymccabe9638]

Thanks for posting this series on Graph Theory, I am finding it very useful!

[@sonluuh]

it's hard to reach the end, you know. I still love it. So many knowledge

[@ken6145]

Thanks man. This video really opens my eyes on how useful graph theory can be.

[@markneumann381]

Really great work. Appreciate this series and its emphasis. Thank you so much.

[@aaryanjavalekar7249]

Golden Standards for teaching! Great work man!

[@Nightaxeblade]

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

[@rachadlakis1]

Thank you for your effort, very professional and scientific information with a clam rythm. Great Job

[@MrKingoverall]

William... I LOVE YOU MAN !!!

[@mikehuang8593]

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.

[@innerpeace5763]

Great Job! Keep it up. Thanks.

[@vipintomar]

Great video!!! Simply awesome and best content . Thank you for sharing this

[@luisleal4169]

Very nice! another useful graph problem: Minimum cuts(ex: Karger's algorithm)

[@orangejuice8339]

Thank you for this. It helps infinitely

[@mohamedsayed8697]

In 1:51 the graph can be unweighted also not only weighted. This is a typing problem on the slide

[@mondal1839]

Very much helpful video. keep uploading more and more videos.

[@rohitkumar-rq6qh]

will you cover advance graph algorithms like Heavy Light Decomposition ? Thanks anyways.These videos deserve more views.

[@WilliamFiset-videos]

It's on my radar, I just need to find a way to fit it into the series.

[@rohitkumar-rq6qh]

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).

[@WilliamFiset-videos]

Perhaps eventually, but for now it would only be one off videos if I ever did that.

[@developmentarchive5642]

Amazing series!

[@aaronaaronaaron5922]

wow man!! you are awesome 🎉 Thanks

[@ttgg8922]

I like this video very Much!

[@nicoandreschmid]

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?

[@evenngmusic8868]

Love from S Korea

[@darshanpatel3312]

Great playlist

[@toshinakaokubo1111]

you are the best, thank you

[@samtux762]

This pseudocode looks like Python. Great playlist.

[@WilliamFiset-videos]

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

[@PatriceStoessel]

1:17 : find the shortest way from A to H (not B)

[@rajvijen]

Yeah, He spoke B instead of H by mistake.

[@erikshure360]

I haven't heard of the traveling salesperson problem; however, I have heard of the traveling salesman problem.

[@yoshikagekira7600]

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.

[@arangsmanickam757]

At 1:10, shouldn't the description say from node A to node H?

[@WilliamFiset-videos]

Yes that's correct, there's a mistake

[@_-6912]

Did you find it difficult to pronounce Kosaraju's name?

[@AJAYSINGH-qk9dx]

please make mathematics video series covering various algorithms

[@funnyaarogya]

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

[@danielniels22]

i am lost at trees with cycle meaning

[@Jehv_gr8tnes]

I am in grade5 and it makes me fly

[@ahmadbodayr7203]

Thank you William god gave you a very bright mind consider reading about islam brother

[@nothingtosay8441]

Dai punda pundya mudiku class ku poda

[@xuxutravel]

Maybe some network motif/ network matching problems? A ton of NP-Hard problems. Search: community search.