Rooted graph

Related lectures (30)

Page 3 of 3

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

Covers Minimum Spanning Trees, Kruskal's Algorithm, and Shortest Paths in directed graphs.

Covers the concept of networks, graphs, subgraphs, directed graphs, and indegree in network theory.

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

Explains the Bellman-Ford algorithm for finding the shortest path in a directed graph with edge weights.

Explores building categories from graphs and the encoding of information by functors.

Covers topics like DFS output, edge classification, acyclic graphs, correctness, time analysis, SCCs, and the Topological Sort algorithm.

Introduces categories, concrete examples, opposite categories, and isomorphisms, leading to groupoids.

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

Explores model selection challenges in causal models and the impact of local geometry on statistical inference.