Topological Sort and SCC

Related lectures (26)

Page 2 of 3

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Explores the properties of undirected and directed graphs, emphasizing connectivity and network topology modeling.

Introduces the basics of graph algorithms, covering traversal, representation, and data structures for BFS and DFS.

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

Explores causal inference through learning graph structures for causal reasoning from observational data.

Covers Breadth-First Search, Depth-First Search, and topological sort in graphs.

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

Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.

Explores coordination among agents in networked control systems through graph theory and real-world examples.

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