Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Prim's algorithm

Related lectures (29)

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.

Minimum Spanning Trees: Prim's Algorithm

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

Union-Find and Minimum Spanning Trees

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

Latent Tree Learning

Explores latent tree learning, covering node properties, sibling relationships, and algorithmic structure.

Union-Find and Prim's Algorithm

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

Untitled

Pitfalls and Caveats in Machine Learning

Covers challenges in machine learning, emphasizing the importance of choosing relevant data and algorithms.

Coin Rendering: Part 1 MOOC: Information, Computation, Communication: Introduction to computational thinking

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

Algorithms: Union Find and Minimum Spanning Trees

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

Untitled

Graph Algorithms II: Traversal and Paths

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

Stein Algorithm: Polynomial Identity Testing

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

Shortest Paths: Negative Weights & Applications

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

Heaps and Priority Queues

Explores heaps, heapsort, and priority queues, including operations and analysis.

Hidden Markov Models: Primer

Introduces Hidden Markov Models, explaining the basic problems and algorithms like Forward-Backward, Viterbi, and Baum-Welch, with a focus on Expectation-Maximization.

Untitled

Nonlinear Truss System Analysis

Explores nonlinear truss system analysis, covering force-displacement responses, event-to-event principles, and solution algorithms.

Minimum Spanning Trees Log in to Mediaspace to watch this video

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

Dijkstra's Algorithm and Probabilistic Analysis Log in to Mediaspace to watch this video

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

Prim's and Kruskal's Algorithms Log in to Mediaspace to watch this video

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