"dancing links" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "Donald Knuth",
        "notext": "1"
      },
      "expansion": "Donald Knuth",
      "name": "coin"
    }
  ],
  "etymology_text": "The name was suggested by Donald Knuth, because iterations of the algorithm cause the links to interact as if in an “exquisitely choreographed dance”.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "dancing links (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A technique for reverting the deletion of a node from a circular doubly-linked list, particularly useful for efficiently implementing backtracking algorithms."
      ],
      "id": "en-dancing_links-en-noun-YTD~-ry6",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "technique",
          "technique"
        ],
        [
          "revert",
          "revert"
        ],
        [
          "deletion",
          "deletion"
        ],
        [
          "node",
          "node"
        ],
        [
          "circular",
          "circular"
        ],
        [
          "doubly-linked",
          "doubly-linked"
        ],
        [
          "list",
          "list"
        ],
        [
          "backtrack",
          "backtrack"
        ],
        [
          "algorithm",
          "algorithm"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A technique for reverting the deletion of a node from a circular doubly-linked list, particularly useful for efficiently implementing backtracking algorithms."
      ],
      "synonyms": [
        {
          "tags": [
            "abbreviation"
          ],
          "word": "DLX"
        }
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "dancing links"
      ]
    }
  ],
  "word": "dancing links"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "Donald Knuth",
        "notext": "1"
      },
      "expansion": "Donald Knuth",
      "name": "coin"
    }
  ],
  "etymology_text": "The name was suggested by Donald Knuth, because iterations of the algorithm cause the links to interact as if in an “exquisitely choreographed dance”.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "dancing links (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English coinages",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms coined by Donald Knuth",
        "English uncountable nouns",
        "en:Theory of computing"
      ],
      "glosses": [
        "A technique for reverting the deletion of a node from a circular doubly-linked list, particularly useful for efficiently implementing backtracking algorithms."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "technique",
          "technique"
        ],
        [
          "revert",
          "revert"
        ],
        [
          "deletion",
          "deletion"
        ],
        [
          "node",
          "node"
        ],
        [
          "circular",
          "circular"
        ],
        [
          "doubly-linked",
          "doubly-linked"
        ],
        [
          "list",
          "list"
        ],
        [
          "backtrack",
          "backtrack"
        ],
        [
          "algorithm",
          "algorithm"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A technique for reverting the deletion of a node from a circular doubly-linked list, particularly useful for efficiently implementing backtracking algorithms."
      ],
      "synonyms": [
        {
          "tags": [
            "abbreviation"
          ],
          "word": "DLX"
        }
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "dancing links"
      ]
    }
  ],
  "word": "dancing links"
}