普林斯頓大學算法公開課筆記

第一章 Union-Find 01 Dynamic connectivity (動態連接性問題即 the model of union find 並查集模型) 問題： a set of N objects (use the numbers zero through N-1 to model our objects). and we then have the idea of a connectio

>>阅读原文<<