Prim's and Kruskal's Algorithms

Related lectures (29)

Page 1 of 3

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

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

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

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

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

Explores dynamic programming strategies for finding shortest paths in networks with various algorithms and complexities.

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

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

Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.

Explores dynamic programming through Pascal's Triangle and Floyd's Algorithm.