Prim's and Kruskal's Algorithms

Related lectures (29)

Page 3 of 3

Introduces spanning trees in graphs and the Minimum Spanning Tree problem, exploring efficient algorithms for optimal decision-making.

Focuses on open problems and the importance of reformulating problems with better tools and intuition.

Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.

Explains the Bellman-Ford algorithm for finding the shortest path in a directed graph with edge weights.

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

Covers the theory and applications of graph coloring, focusing on disassortative stochastic block models and planted coloring.

Explores Breadth-First Search and Dijkstra's algorithm for finding shortest paths in graphs.

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Covers Dijkstra's algorithm for shortest path problems and its application in ALL-TO-ONE and ALL-PAIRS algorithms.