{"version":"1.0","type":"link","title":"Dancing links - Newikis","description":"In computer science, dancing links (DLX) is a technique for adding and deleting a node from a circular doubly linked list. It is particularly useful for efficiently implementing backtracking algorithms, such as Knuth's Algorithm X for the exact cover problem. Algorithm X is a recursive,…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}