"Reingold-Tilford algorithm" meaning in All languages combined

{
  "etymology_text": "Introduced in a 1981 paper by Edward Reingold and John Tilford.",
  "forms": [
    {
      "form": "Reingold-Tilford algorithms",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Reingold-Tilford algorithm (plural Reingold-Tilford algorithms)",
      "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": "other",
          "name": "English entries with language name categories using raw markup",
          "parents": [
            "Entries with language name categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "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": [
        "An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees)."
      ],
      "id": "en-Reingold-Tilford_algorithm-en-noun-qXziQVOS",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "aesthetically",
          "aesthetically"
        ],
        [
          "pleasing",
          "pleasing"
        ],
        [
          "drawing",
          "drawing"
        ],
        [
          "binary tree",
          "binary tree"
        ],
        [
          "n-ary",
          "n-ary"
        ]
      ],
      "raw_glosses": [
        "(computing theory) An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees)."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Reingold-Tilford algorithm"
}

{
  "etymology_text": "Introduced in a 1981 paper by Edward Reingold and John Tilford.",
  "forms": [
    {
      "form": "Reingold-Tilford algorithms",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Reingold-Tilford algorithm (plural Reingold-Tilford algorithms)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "en:Theory of computing"
      ],
      "glosses": [
        "An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees)."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "aesthetically",
          "aesthetically"
        ],
        [
          "pleasing",
          "pleasing"
        ],
        [
          "drawing",
          "drawing"
        ],
        [
          "binary tree",
          "binary tree"
        ],
        [
          "n-ary",
          "n-ary"
        ]
      ],
      "raw_glosses": [
        "(computing theory) An algorithm that generates aesthetically pleasing drawings of binary trees (and by extension, n-ary trees)."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "Reingold-Tilford algorithm"
}