And query the path compression of the Set (recursive and non-recursive)

Source: Internet
Author: User
The idea here is that we change the father of every child into his ancestor every time we look for Father's Day. Because it is possible that a child's relationship is very complicated, it may be a chain, so there is no waste of time in searching. // This is a simple Recursive Implementation of find (int x) {While (X! = Father [x]) Father [x] = find (father [x]); Return father [X];} // This is a non-recursive find (int x) {int r = x; while (R! = Father [R]) // locate the r ancestor node r = Father [R]; int K = x; while (K! Father [k]) {FATHER [k] = r; k = Father [X]; X = K ;}}


Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.