[7.6] Union Find (Disjoint Set) Algorithm in Python (Detect Cycle in Undirected Graph)

Опубликовано: 29 Сентябрь 2024
на канале: ThinkX Academy

3,252

Union Find or Disjoint Set data structure is a data structure that stores collection of disjoint sets(non-overlapping sets).
It has 2 main operations:

1) find - It returns the parent of the subset the given value belongs to
2) Union - It combines the two subsets (by assigning parent of one subset to another)
It has various applications:

1) Kruskal's Algorithm

2) Detect Cycle in a graph

We will learn how to implement union find in python to detect cycle in a graph.

00:00 What is Union Find?
20:17 Detecting Cycle
24:16 Python Program for Union Find

🔗Important Links:
Data Structures in Python: https://www.thinkxacademy.com/Data%20...

Playlist: • Data Structures in Python

🌐Join our community:
Android App(Notes+Videos): https://play.google.com/store/apps/de... Facebook: / thinkxacademy Twitter: / thinkxacademy Instagram: / thinkxacademy