Overview of algorithms in Graph Theory

An overview of the computer science algorithms in Graph Theory Support me by purchasing the full graph theory course on Udemy which includes additional problems, exercises and quizzes not available on YouTube: https://www.udemy.com/course/graph-theory-algorithms Previous video (intro): https://youtu.be/eQA-m22wjTQ Next video (depth first search): https://youtu.be/7fujbpJ0LB4 Algorithms repository: https://github.com/williamfiset/algorithms#graph-theory Slides: https://github.com/williamfiset/Algorithms/tree/master/slides/graphtheory Graph Theory Videos: https://www.youtube.com/playlist?list=PLDV1Zeh2NRsDGO4--qE8yH72HFL1Km93P 0:00 Introduction 1:09 Shortest path problem 1:55 Connectivity 2:27 Negative cycles 4:03 Strongly Connected Components (SCCs) 4:48 Traveling salesman problem 5:50 Bridges and articulation points 6:42 A minimum spanning tree (MST) 7:53 Network flow =============================== Practicing for interviews? I have used, and recommend `Cracking the Coding Interview` which got me a job at Google. Link on Amazon: https://amzn.to/3cvMof5 A lot of the content on this channel is inspired by the book `Competitive Programming` by Steven Halim which I frequently use as a resource and reference. Link on Amazon: https://amzn.to/3wC2nix Support me by purchasing the full graph theory course on Udemy which includes additional problems, exercises and quizzes not available on YouTube: https://www.udemy.com/course/graph-theory-algorithms