DSA Unit 5 Part-3: Prim’s & Kruskal’s Algorithm | MST Examples Explained
9:42
YouTubeN2K TECH
DSA Unit 5 Part-3: Prim’s & Kruskal’s Algorithm | MST Examples Explained
🎓 Welcome back to N2K Tech — Turning Notes into Knowledge! In this lecture of DSA Unit 5 (Graph Data Structure), we cover two of the most important Minimum Spanning Tree algorithms — Prim’s Algorithm and Kruskal’s Algorithm. This class explains both algorithms using simple notes, step-by-step tables, and fully solved examples ...
2 天之前
Disjoint-set data structure Implementation
Disjoint–Set Data Structure (Union–Find Algorithm) | Techie Delight
Disjoint–Set Data Structure (Union–Find Algorithm) | Techie Delight
techiedelight.com
2016年11月24日
Introduction to Disjoint Set (Union-Find Data Structure) - GeeksforGeeks
10:17
Introduction to Disjoint Set (Union-Find Data Structure) - GeeksforGeeks
geeksforgeeks.org
2019年10月15日
The dynamic-set operation UNION takes two disjoint sets S_{1} a... | Filo
The dynamic-set operation UNION takes two disjoint sets S_{1} a... | Filo
askfilo.com
已浏览 5396 次2024年4月5日
热门视频
Advent of Code 2025 - Day 8 (Python)
19:08
Advent of Code 2025 - Day 8 (Python)
YouTubeDylan Does Tech
已浏览 42 次3 天之前
Playground [AOC2025 Day 8]
27:16
Playground [AOC2025 Day 8]
YouTube0xdf
3 天之前
Advent of Code 2025 Day 8
10:07
Advent of Code 2025 Day 8
YouTubeJonathan Paulson
已浏览 1950 次4 天之前
Disjoint-set data structure Applications
Understanding Data Structures: Types and Applications
Understanding Data Structures: Types and Applications
analytixlabs.co.in
2022年6月8日
Lecture 32: Disjoint-Set Data Structure
50:03
Lecture 32: Disjoint-Set Data Structure
YouTubeIIT KANPUR-NPTEL
已浏览 238 次2 个月之前
Design a data structure to support the following two operations for a dynamic multiset S of integers, which allows duplicate values: INSERT (S, x) inserts x into S. DELETE-LARGER-HALF (S) deletes the largest ⌈|S| / 2⌉elements from S . Explain how to implement this data structure so that any sequence of m INSERT and DELETE-LARGER-HALF operations runs in O(m) time. Your implementation should also include a way to output the elements of S in O(|S|) time. | Numerade
Design a data structure to support the following two operations for a dynamic multiset S of integers, which allows duplicate values: INSERT (S, x) inserts x into S. DELETE-LARGER-HALF (S) deletes the largest ⌈|S| / 2⌉elements from S . Explain how to implement this data structure so that any sequence of m INSERT and DELETE-LARGER-HALF operations runs in O(m) time. Your implementation should also include a way to output the elements of S in O(|S|) time. | Numerade
numerade.com
2024年2月22日