Lectures related to Directed Graphs: Introduction and Categories

Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

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

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

Covers the definition of a group, properties of symmetries, and group operations.

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

Covers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.