Concept
Kruskal's algorithm
Related lectures (43)
Dijkstra's Algorithm and Probabilistic Analysis
Introduces Dijkstra's algorithm and probabilistic analysis through the Hiring Problem.
Algorithmic Complexity: Definition and Examples
Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.
Shortest Paths: Negative Weights & Applications
Covers Minimum Spanning Trees, Kruskal's Algorithm, and Shortest Paths in directed graphs.
Minimum Spanning Trees
Covers the implementation and analysis of disjoint sets data structure and introduces the concept of minimum spanning trees.
Clustering: k-means
Explains k-means clustering, assigning data points to clusters based on proximity and minimizing squared distances within clusters.
Prim's and Kruskal's Algorithms
Explores Prim's and Kruskal's algorithms, focusing on greedy approaches and implementation challenges.
Prim's and Kruskal's Algorithms
Explores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
Union-Find and Minimum Spanning Trees
Covers the Union-Find data structure and Minimum Spanning Trees.
Submodular Maximization
Covers submodular function maximization using the greedy algorithm and its approximation guarantee.
Algorithms & Growth of Functions
Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.