DFS Continuation: Topological SortCovers topics like DFS output, edge classification, acyclic graphs, correctness, time analysis, SCCs, and the Topological Sort algorithm.
Graph Algorithms: BasicsIntroduces the basics of graph algorithms, covering traversal, representation, and data structures for BFS and DFS.
Topological Sort and SCCExplores topological sort, acyclic graphs, Strongly Connected Components, magic algorithm, component graph, flow networks, and their applications.
Causal Inference & Directed GraphsExplores causal inference, directed graphs, and fairness in algorithms, emphasizing conditional independence and the implications of DAGs.
Network Flows Meets SimplexExplores network flows, simplex method, linear programming, tree solutions, and dual solutions in optimization problems.
Shortest Path in Directed GraphsCovers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.
