Graph Theory Algorithms

Graph Theory algorithms video series Support me by purchasing the full graph theory playlist on Udemy. This version offers additional problems, exercises and quizzes not available on YouTube: https://www.udemy.com/course/graph-theory-algorithms Graph Theory video series playlist on YouTube: https://www.youtube.com/playlist?list=PLDV1Zeh2NRsDGO4--qE8yH72HFL1Km93P Topics covered in these videos include: how to store and represent graphs on a computer; common graph theory problems seen in the wild; tree algorithms; famous graph traversal algorithms (DFS & BFS); Dijkstra's shortest path algorithm; what a topological sort is, how to find one, and places it's used; learning about detecting negative cycles and finding shortest paths with the Bellman-Ford and Floyd-Warshall algorithms; discovering bridges and articulation points in graphs; understanding and detecting strongly connected components with Tarjan's algorithm, how to solve the traveling salesman problem with dynamic programming, a variety of network flow topics and etc... What you’ll learn: - Storage and representation of graphs (networks) on a computer - Common graph theory problems - A variety of tree algorithms - Breadth first search algorithm - Depth first search algorithm - Dijkstra's algorithm - Topological sort algorithm - Shortest/longest path on a acyclic graph - Bellman Ford's algorithm - Floyd-Warshall all pairs shortest path algorithm - Finding bridges/articulation points - Finding strongly connected components (Tarjan's) - Travelling salesman problem (TSP) - Network flow topics such as the Ford Fulkerson method and bipartite graph matching Are there any course requirements/prerequisites to the series? - Some prior programming knowledge. - Exposure to computer science fundamentals such as: data structures, recursion, classes, and OOP will all come handy. ==================================== Practicing for interviews? I have used, and recommend `Cracking the Codin