Explore the fundamental concepts and algorithms of Graph Theory in this comprehensive 8-hour course. Dive into essential topics such as Depth First Search, Breadth First Search, and tree algorithms. Master advanced techniques including Topological Sort, Dijkstra's Shortest Path, and Floyd Warshall All Pairs Shortest Path. Delve into complex problems like the Travelling Salesman Problem and Network Flow algorithms. Learn to implement these algorithms with provided source code examples. Gain a solid understanding of graph theory applications in solving real-world problems, from identifying isomorphic trees to optimizing network flows.
Overview
Syllabus
Graph Theory Algorithms.
Graph Theory Introduction.
Overview of algorithms in Graph Theory.
Depth First Search Algorithm | Graph Theory.
Breadth First Search Algorithm | Shortest Path | Graph Theory.
Breadth First Search grid shortest path | Graph Theory.
Introduction to tree algorithms | Graph Theory.
Beginner tree algorithms | Graph Theory.
Rooting a tree | Graph Theory.
Tree center(s) | Graph Theory.
Identifying Isomorphic Trees | Graph Theory.
Identifying Isomorphic Trees | Source Code | Graph Theory.
Lowest Common Ancestor (LCA) Problem | Eulerian path method.
Lowest Common Ancestor (LCA) Problem | Source Code.
Topological Sort Algorithm | Graph Theory.
Topological Sort | Kahn's Algorithm | Graph Theory.
Shortest/Longest path on a Directed Acyclic Graph (DAG) | Graph Theory.
Dijkstra's Shortest Path Algorithm | Graph Theory.
Dijkstra's Shortest Path Algorithm | Source Code | Graph Theory.
Bellman Ford Algorithm | Shortest path & Negative cycles | Graph Theory.
Floyd Warshall All Pairs Shortest Path Algorithm | Graph Theory | Dynamic Programming.
Floyd Warshall All Pairs Shortest Path Algorithm | Graph Theory | Dynamic Programming | Source Code.
Tarjan's Strongly Connected Component (SCC) Algorithm (UPDATED) | Graph Theory.
Tarjans Strongly Connected Components algorithm source code | Graph Theory.
Travelling Salesman Problem | Dynamic Programming | Graph Theory.
Travelling Salesman Problem source code | Dynamic Programming | Graph Theory.
Existence of Eulerian Paths and Circuits | Graph Theory.
Eulerian Path/Circuit algorithm (Hierholzer's algorithm) | Graph Theory.
Eulerian Path Algorithm | Graph Theory | Source Code.
Prim's Minimum Spanning Tree Algorithm | Graph Theory.
Eager Prim's Minimum Spanning Tree Algorithm | Graph Theory.
Eager Prim's Minimum Spanning Tree Algorithm | Source Code.
Max Flow Ford Fulkerson | Network Flow | Graph Theory.
Max Flow Ford Fulkerson | Source Code.
Unweighted Bipartite Matching | Network Flow | Graph Theory.
Bipartite Matching | Mice and Owls problem | Network Flow | Graph Theory.
Bipartite Matching | Elementary Math problem | Network Flow | Graph Theory.
Edmonds Karp Algorithm | Network Flow | Graph Theory.
Edmonds Karp Algorithm | Source Code.
Capacity Scaling | Network Flow | Graph Theory.
Capacity Scaling | Network Flow | Source Code.
Dinic's Algorithm | Network Flow | Graph Theory.
Dinic's Algorithm | Network Flow | Source Code.
Taught by
WilliamFiset
