Notes/Lecture_Notes
1
0
Fork 0
mirror of https://github.com/dholerobin/Lecture_Notes.git synced 2025-09-13 05:42:12 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update DSU.md

Browse Source
This commit is contained in:
Aakash Panchal
2020-01-14 19:26:05 +05:30
committed by GitHub
parent d852b963bf
commit e4e9c3439f
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Akash Articles/DSU.md
View File

@@ -130,7 +130,7 @@ This is too much. Right? What else can we do?
We have a technique named **"Path compression"**, which burns this time to $O(log^*N)$. $log^*N$ is iterated logarithm-number of time you have to apply $log$ to $N$ before the result is less than or equal to 1.
The idea of the Path compression is: **It re-connects every vertex to the root vertex directly rather than by a path**.
The idea of the Path compression is: **It re-connects every vertex to the root vertex directly, rather than by a path**.
If we apply $\text{Find}(d)$ operation with the path compression, then the following thing will happen.
![enter image description here](https://lh3.googleusercontent.com/ltQXkpZAjEO543ibrVodpMMZp2IHXVJ7Rjxevm2ztJQAC67UnvBeMmwEoIB9qZ0_2PgpSs98nWV9)