原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
es head, pointing to the first object in the list, and tail, pointing to the last object.
Each object in the list contains a set member, a pointer to the next object in the list, and a pointer back to the set object. Within each linked list, the objects may appear in any order. The representative is the set member in the first object in the list. With this linked-list representation, both MAKE-SET and FIND-SET require only O(1) time.
To carry out MAKE-SET(x), create a new linked list whose only object is x. For FIND-SET(x
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea