Lectures related to Bellman Ford: Shortest Paths

Discusses graph algorithms, focusing on flow networks and strongly connected components.

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

Explores Breadth-First Search and Dijkstra's algorithm for finding shortest paths in graphs.

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 network flows, simplex method, linear programming, tree solutions, and dual solutions in optimization problems.

Explores simple paths, connectivity, equivalence classes, and connected components in directed graphs.

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