This course provides a complete introduction to Graph Theory algorithms in computer science.

Description

Topics covered in these videos include: how to store and represent graphs on a computer; common graph theory problems seen in the wild; famous graph traversal algorithms (DFS & BFS); Dijkstra's shortest path algorithm (both the lazy and eager version); 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, and finally solving the travelling salesman problem with dynamic programming.

• Anybody ready for a deep dive into graph theory!

Course content

• Graph Theory Algorithms
  • Graph Theory Introduction
  • Problems in Graph Theory
  • Depth First Search algorithm
  • Breadth First Search algorithm
  • Breadth First Search grid shortest path
  • Dijkstra's shortest path algorithm
  • Dijkstra's shortest path algorithm | source code
  • Topological sort algorithm
  • Shortest/longest path on a Directed Acyclic Graph (DAG)
  • Bellman-Ford algorithm
  • Floyd-Warshall all pairs shortest path algorithm
  • Floyd-Warshall all pairs shortest path algorithm | source code
  • Bridges & Articulation points
  • Bridges & Articulation points | source code
  • Tarjan's strongly connected components algorithm
  • Tarjan's strongly connected components algorithm | source code
  • Travelling Salesman problem
  • Travelling Salesman problem | source code
  • Existence of Eulerian path and circuits
  • Eulerian path algorithm
  • Eulerian path source code
  • Max Flow Ford Fulkerson | Network Flow
  • Max Flow Ford Fulkerson | source code
  • Unweighted bipartite matching | Network flow
  • Mice and Owls | Network Flow
  • Elementary Math | Network Flow
  • Edmonds Karp | Network Flow
  • Edmonds Karp | Network Flow | Source Code
  • Capacity Scaling | Network Flow
  • Capacity Scaling | Network Flow | Source Code
  • Dinic's Algorithm | Network Flow
  • Dinic's Algorithm | Network Flow | Source Code