[Princeton Algorithms I] Union-Find

最新推荐文章于 2024-09-23 14:50:51 发布

weixin_43514288

最新推荐文章于 2024-09-23 14:50:51 发布

阅读量182

点赞数

分类专栏： PrincetonAlgorithms 文章标签：数据结构 java

本文链接：https://blog.csdn.net/weixin_43514288/article/details/107686757

版权

本文详细介绍了动态连通性问题及其解决数据结构——Union-Find。内容涵盖Quick-Find、Quick-Union、Weighted Quick-Union以及Weighted Quick-Union with Path Compression（WQUPC）的实现和成本模型。Quick-Find虽然简单但效率低下，而Quick-Union通过延迟连接更新避免了高成本，但可能导致树形结构失衡。Weighted Quick-Union通过将较小的树连接到较大的树来平衡结构，进一步优化了查找时间。WQUPC通过路径压缩进一步提高性能，使得查找和合并操作的时间复杂度接近O(log n)。此外，还探讨了Union-Find在如渗透问题等应用中的重要性。

摘要由CSDN通过智能技术生成

Union-Find

https://algs4.cs.princeton.edu/15uf/

Dynamic Connectivity Problem

a dynamic connectivity structure is a data structure that dynamically maintains information about the connected components of a graph.

Union-Find API

在这里插入图片描述

Implementations

Quick-Find (eager approach)

在这里插入图片描述
Data Structure:

Integer array id[ ] of size N
Interpretation: p and q are connected iff they have the same id
default config: each id equals to its index

Find: check if p and q have the same id

Union: To merge components contatining p and q, change all entires whose id equals id[p] to id[q]

Implementation

public class QuickFindUF {
   
    private int[] id;    // id[i] = component identifier of i
    private int count;   // number of components

    /**
    constructor
     */
    public QuickFindUF(int n) {
   
        count = n;
        id = new int[n];
        for (int i = 0; i < n; i++)
            id[i] = i;
    }
  
    /**
     * Returns the number of sets.
     */
    public int count() {
   
        return count;
    }
  
    /**
     * Returns the canonical element of the set containing element p.
     */
    public int find(int p) {
   
        validate(p);
        return id[p];
    }

    // validate that p is a valid index
    private void validate(int p) {
   
        int n = id.length;
        if (p < 0 || p >= n) {
   
            throw new IllegalArgumentException("index " + p + " is not between 0 and " + (n-1));
        }
    }

    /**
     * Returns true if the two elements are in the same set.
     */
    @Deprecated
    public boolean connected(int p, int q) {
   
        validate(p);
        validate(q);
        return id[p] == id[q