New York: Addison-Wesley, 2019. — 276 p.
Dancing links. One of the chief characteristics of backtrack algorithms is the fact that they usually need to undo everything that they do to their data structures. In this section we’ll study some extremely simple linkmanipulation techniques that modify and unmodify the structures with ease.
We’ll also see that these ideas have many, many practical applications