普林斯顿大学算法公开课笔记

第一章 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

>>阅读原文<<