Concept

Kruskal's algorithm

Related lectures (25)

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.

Explores Prim's and Kruskal's algorithms, focusing on greedy approaches and implementation challenges.

Covers the Union-Find data structure and Minimum Spanning Trees.

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

Covers the concept of weighted graphs and the Greedy algorithm for finding a minimal spanning tree.

Introduces Union-Find data structure and Prim's algorithm for minimum spanning trees in graphs, exploring cuts and historical origins.

Covers minimum spanning trees, disjoint-set data structures, union methods, and Prim's algorithm for finding minimum spanning trees.

Discusses Union-Find data structures and Minimum Spanning Trees, covering algorithms and their applications in network design and optimization.

Introduces Dijkstra's algorithm and probabilistic analysis through the Hiring Problem.

Covers Minimum Spanning Trees, Kruskal's Algorithm, and Shortest Paths in directed graphs.

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

Explores dynamic programming with Fibonacci numbers, greedy coin change algorithms, graph coloring, and knapsack variants.

Covers submodular function maximization using the greedy algorithm and its approximation guarantee.

Explores the Stein algorithm for polynomial identity testing and the minimization of a cut problem.

Explores the coin change problem, comparing greedy and dynamic programming algorithms for optimal solutions.

Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.

Covers the concept of stable matchings and the Gale-Shapley algorithm.

Explores optimization problems and greedy algorithms to find the best solutions efficiently.

Distinguishes between subgraphs and induced subgraphs in graph theory, illustrating the construction of minimal spanning trees.