Directed Graphs: Introduction and Categories

Related lectures (27)

Page 2 of 3

Explores mapping functions, surjections, injective and surjective functions, and bijective functions.

Covers the fundamentals of connectivity in graph theory, including paths, cycles, and spanning trees.

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

Explores examples of categories, morphisms, groupoids, and functors in category theory.

Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.

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

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

Covers the basics of categories and functors, exploring properties, composition, and uniqueness in category theory.

Explores ecological vision and computational agent design in the context of visual perception and behavior.

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