Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Minimum Spanning Trees
Description
This lecture covers the implementation and analysis of disjoint sets data structure, including list representation, Make-Set, Find, Union, weighted-union heuristic, and great heuristics like Union by rank. It also introduces the concept of minimum spanning trees, explaining the origin, spanning tree of a graph, and Prim's and Kruskal's algorithms.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on MediaspaceOfficial source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.