Lee algorithm in English

[Show JSON for postprocessed kaikki.org data shown on this page ▼] [Hide JSON for postprocessed kaikki.org data shown on this page ▲]

{
  "etymology_text": "Introduced by C. Y. Lee in a 1961 paper.",
  "forms": [
    {
      "form": "the Lee algorithm",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Lee algorithm",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        }
      ],
      "glosses": [
        "A breadth-first search algorithm that finds optimal solutions for maze routing problems, used in the design of electronic components etc."
      ],
      "id": "en-Lee_algorithm-en-name-gDf55kne",
      "links": [
        [
          "breadth-first search",
          "breadth-first search"
        ],
        [
          "optimal",
          "optimal"
        ],
        [
          "solution",
          "solution"
        ],
        [
          "maze",
          "maze"
        ],
        [
          "routing",
          "route"
        ],
        [
          "electronic",
          "electronic"
        ],
        [
          "component",
          "component"
        ]
      ]
    }
  ],
  "word": "Lee algorithm"
}

[Show JSON for raw wiktextract data ▼] [Hide JSON for raw wiktextract data ▲]

{
  "etymology_text": "Introduced by C. Y. Lee in a 1961 paper.",
  "forms": [
    {
      "form": "the Lee algorithm",
      "tags": [
        "canonical"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "def": "1"
      },
      "expansion": "the Lee algorithm",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries"
      ],
      "glosses": [
        "A breadth-first search algorithm that finds optimal solutions for maze routing problems, used in the design of electronic components etc."
      ],
      "links": [
        [
          "breadth-first search",
          "breadth-first search"
        ],
        [
          "optimal",
          "optimal"
        ],
        [
          "solution",
          "solution"
        ],
        [
          "maze",
          "maze"
        ],
        [
          "routing",
          "route"
        ],
        [
          "electronic",
          "electronic"
        ],
        [
          "component",
          "component"
        ]
      ]
    }
  ],
  "word": "Lee algorithm"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2025-02-15 from the enwiktionary dump dated 2025-02-02 using wiktextract (ca09fec and c40eb85). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.

"Lee algorithm" meaning in English

Proper name