Загрузка...

Disjoint Set Union (DSU) Explained | Union Find Data Structure with Kruskal’s Algorithm

* Introduction to Disjoint Set Union
* Motivation and History
* DSU Representation as Trees
* Find Operation
* Union Operation
* Path Compression
* Union by Rank / Union by Size
* Time Complexity Analysis
* Kruskal’s Minimum Spanning Tree Algorithm
* Real-life Applications of DSU

This presentation is designed for students learning:

* Data Structures
* Algorithms
* Competitive Programming
* Graph Theory

Team Members:

* Rafsan Alam - 2024331077
* Ishrak Mujib Iftee - 2024331075
* Muhammad Reduwanul Islam - 2024331093
* Kowser Ahmed - 2024331052
* Najmus Sakib Mahim - 2024331021

If you enjoyed the presentation, don’t forget to:
👍 Like
💬 Comment
📌 Share
🔔 Subscribe for more educational content

#DSU #DisjointSetUnion #UnionFind #DataStructures #Algorithms #CompetitiveProgramming #KruskalAlgorithm #DSA #GraphAlgorithms

Видео Disjoint Set Union (DSU) Explained | Union Find Data Structure with Kruskal’s Algorithm канала RAFSAN_007
Яндекс.Метрика
Все заметки Новая заметка Страницу в заметки
Страницу в закладки Мои закладки
На информационно-развлекательном портале SALDA.WS применяются cookie-файлы. Нажимая кнопку Принять, вы подтверждаете свое согласие на их использование.
О CookiesНапомнить позжеПринять