Lectures related to Networks: Paths and Components

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

Introduces the concept of categories essential for understanding group theory.

Explores the properties of trees in graph theory, focusing on nodes, paths, cycles, and the characterization of trees in a directed graph.

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

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

Introduces the Bellman-Ford algorithm for finding shortest paths in directed graphs with edge weights.

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

Explores topological sort, acyclic graphs, Strongly Connected Components, magic algorithm, component graph, flow networks, and their applications.