Algorithms: Union Find and Minimum Spanning Trees

Related lectures (28)

Page 1 of 3

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

Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.

Covers the concept of matroids, focusing on matroid intersection and the properties of subsets of a ground set.

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

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

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

Explores the Ford-Fulkerson method, max-flow, applications of max-flow, and the disjoint-set data structure.

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

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 graph sketching with a focus on connected components.