Search Quick Union Find (storage structure of the graph)

Source: Internet
Author: User
Quick Find: For frequent search situations Each node has an ID value with the same ID indicating that two nodes are connected to each other. At Union, change the value of one ID to another ID value . Quick Union: applies to Union frequent cases each node has an ID value, and the ID value indicates the subscript of the node to which the node is connected; Each node has a root value, root (i) = Id[id[id ...]), until id[i]==i. The same root value indicates that the two nodes are connected, so connecting two nodes is the root value of one node in the two nodes that is the root of the other node. Union 9 and 6

Search Quick Union Find (storage structure of the graph)

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: info-contact@alibabacloud.com 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.