dancing links

/D AE1 N S IH0 NG L IH0 NG K S/
noun
  1. 1

    (computing theory) A technique for reverting the deletion of a node from a circular doubly-linked list, particularly useful for efficiently implementing backtracking algorithms.

Translate “dancing links” into another language