Rooted graph

Related lectures (30)

Page 2 of 3

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

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

Explores strongly connected components and condensation digraphs in networked control systems, demonstrating their practical implications.

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

Explores network flows, simplex method, linear programming, tree solutions, and dual solutions in optimization problems.

Covers the fundamental notion of composition in directed graphs and provides examples of their representation.

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

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

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

Introduces Strongly Connected Components and Flow Networks, discussing algorithms and applications.