Shortest Paths: Negative Weights & Applications

Related lectures (29)

Page 1 of 3

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

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

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

Covers the implementation and analysis of disjoint sets data structure and introduces the concept of minimum spanning trees.

Explains the Bellman-Ford algorithm for finding the shortest path in a directed graph with edge weights.

Explores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.

Covers the concept of maximum flow-minimum cut in directed graphs with capacity constraints.

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

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