Lectures related to DFS Continuation: Topological Sort

Flow Networks: Understanding Flows and Cuts in Algorithms

Covers flow networks, focusing on flows, cuts, and their applications in algorithms.

Explores causal inference, directed graphs, and fairness in algorithms, emphasizing conditional independence and the implications of DAGs.

Graph Theory Fundamentals

Covers the fundamentals of graph theory, including vertices, edges, degrees, walks, connected graphs, cycles, and trees, with a focus on the number of edges in a tree.

Graph Coloring and Directed Cycles

Explores graph coloring, directed cycles, LLL algorithm applications, and element dependencies in graphs.

Properties of Trees: Nodes, Paths, and Cycles

Explores the properties of trees in graph theory, focusing on nodes, paths, cycles, and the characterization of trees in a directed graph.

Graph Representation and Traversal

Introduces graph theory basics, graph representation methods, and traversal algorithms like BFS and DFS.

Graphs and Networks: Basics and Applications

Introduces the basics of graphs and networks, covering definitions, paths, trees, flows, circulation, and spanning trees.