does using size arr to compress path is same as the Union by Rank method, or how they are different , i have studied Disjoint Set Union with Path Compression but havent found any resource related to Union Find by Rank Method, and this concept is used in Krushkal’s Algo, that’s why im kinda confuse, plz help, i beg
Path Compression | Union by Rank
moreover GoG articles wont helped much,
@akb.tech17
Yes path compression is same as union by rank method
Path compression is the main idea behind it which reduces complexity from logn to O(1)
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.