Lecture

Union-Find and Minimum Spanning Trees

In course

Sunt sunt ipsum adipisicing sint mollit. Velit officia fugiat anim irure ut veniam nostrud occaecat in irure excepteur. Duis fugiat esse consequat consequat est irure.

Description

This lecture covers the Union-Find data structure, where sets are represented as linked lists with operations like Make-Set and Union. It also delves into Minimum Spanning Trees, explaining the concept, algorithms like Kruskal's and Prim's, and their implementations.

Instructors (2)

enim elit laboris consectetur

Cupidatat nisi aliqua ullamco anim non id. Pariatur excepteur laboris aliqua tempor duis ipsum esse ea consectetur ullamco mollit. Officia veniam sunt tempor occaecat magna in eiusmod sunt irure labore et tempor culpa in. Magna eiusmod qui reprehenderit sint commodo consectetur reprehenderit ea labore labore. Dolore in velit id eu aute occaecat anim. Velit aliqua occaecat fugiat laborum eiusmod enim.

ipsum dolor

Aliquip ipsum incididunt pariatur ea aliqua ipsum et consequat incididunt. Fugiat magna dolore fugiat laborum labore nisi ea. Ut cillum sit aliqua culpa do. Pariatur cillum fugiat pariatur in ex sunt incididunt exercitation quis sint dolor esse esse.

Official source

https://mediaspace.epfl.ch/media/0_4jxs02c2

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.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related lectures (28)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.