Directed Graphs: Introduction and Categories

Related lectures (27)

Page 1 of 3

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

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

Covers the basics of graph algorithms, focusing on modeling and representation of graphs in memory.

Covers the introduction to categories, including definitions and examples.

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

Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.

Introduces the concept of categories essential for understanding group theory.

Covers the independence polynomial of a dependency graph and related concepts such as graph coloring and directed graph properties.

Covers the fundamentals of integer programming and network flows in directed graphs.

Covers the concept of maximum flow-minimum cut in directed graphs with capacity constraints.