文件名称：dancing link
文件大小：1.62MB
文件格式：PS
更新时间：2017-07-08 03:29:48
算法
My purpose is to discuss an extremely simple technique that deserves to be better known. Suppose x points to an element of a doubly linked list; let L[x] and R[x] point to the predecessor and successor of that element. Then the operations L R[x] ← L[x], R L[x] ← R[x] (1) remove x from the list; every programmer knows this. But comparatively few programmers have realized that the subsequent operations