"breadth-first search" meaning in English

See breadth-first search in All languages combined, or Wiktionary

Noun

Forms: breadth-first searches [plural]
Head templates: {{en-noun|~}} breadth-first search (countable and uncountable, plural breadth-first searches)
  1. (graph theory) A search algorithm that begins at the root node and explores all the neighboring nodes. Tags: countable, uncountable Categories (topical): Graph theory Synonyms: BFS Translations (a search algorithm): larĝema trairo (Esperanto), larĝiĝema trairo (Esperanto), leveyshaku (Finnish), Breitensuche (German), þverleit [feminine] (Icelandic), breiddarleit [feminine] (Icelandic), visita in ampiezza [feminine] (Italian), przeszukiwanie wszerz [neuter] (Polish)
    Sense id: en-breadth-first_search-en-noun-TBdDPPGq Categories (other): English entries with incorrect language header Topics: graph-theory, mathematics, sciences

Inflected forms

Alternative forms

Download JSON data for breadth-first search meaning in English (2.2kB)

{
  "forms": [
    {
      "form": "breadth-first searches",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "breadth-first search (countable and uncountable, plural breadth-first searches)",
      "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": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "Coordinate term: depth-first search"
        }
      ],
      "glosses": [
        "A search algorithm that begins at the root node and explores all the neighboring nodes."
      ],
      "id": "en-breadth-first_search-en-noun-TBdDPPGq",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "search",
          "search"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "root",
          "root"
        ],
        [
          "node",
          "node"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A search algorithm that begins at the root node and explores all the neighboring nodes."
      ],
      "synonyms": [
        {
          "word": "BFS"
        }
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "translations": [
        {
          "code": "eo",
          "lang": "Esperanto",
          "sense": "a search algorithm",
          "word": "larĝema trairo"
        },
        {
          "code": "eo",
          "lang": "Esperanto",
          "sense": "a search algorithm",
          "word": "larĝiĝema trairo"
        },
        {
          "code": "fi",
          "lang": "Finnish",
          "sense": "a search algorithm",
          "word": "leveyshaku"
        },
        {
          "code": "de",
          "lang": "German",
          "sense": "a search algorithm",
          "word": "Breitensuche"
        },
        {
          "code": "is",
          "lang": "Icelandic",
          "sense": "a search algorithm",
          "tags": [
            "feminine"
          ],
          "word": "þverleit"
        },
        {
          "code": "is",
          "lang": "Icelandic",
          "sense": "a search algorithm",
          "tags": [
            "feminine"
          ],
          "word": "breiddarleit"
        },
        {
          "code": "it",
          "lang": "Italian",
          "sense": "a search algorithm",
          "tags": [
            "feminine"
          ],
          "word": "visita in ampiezza"
        },
        {
          "code": "pl",
          "lang": "Polish",
          "sense": "a search algorithm",
          "tags": [
            "neuter"
          ],
          "word": "przeszukiwanie wszerz"
        }
      ]
    }
  ],
  "word": "breadth-first search"
}
{
  "forms": [
    {
      "form": "breadth-first searches",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "breadth-first search (countable and uncountable, plural breadth-first searches)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English uncountable nouns",
        "en:Graph theory"
      ],
      "examples": [
        {
          "text": "Coordinate term: depth-first search"
        }
      ],
      "glosses": [
        "A search algorithm that begins at the root node and explores all the neighboring nodes."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "search",
          "search"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "root",
          "root"
        ],
        [
          "node",
          "node"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A search algorithm that begins at the root node and explores all the neighboring nodes."
      ],
      "synonyms": [
        {
          "word": "BFS"
        }
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "translations": [
    {
      "code": "eo",
      "lang": "Esperanto",
      "sense": "a search algorithm",
      "word": "larĝema trairo"
    },
    {
      "code": "eo",
      "lang": "Esperanto",
      "sense": "a search algorithm",
      "word": "larĝiĝema trairo"
    },
    {
      "code": "fi",
      "lang": "Finnish",
      "sense": "a search algorithm",
      "word": "leveyshaku"
    },
    {
      "code": "de",
      "lang": "German",
      "sense": "a search algorithm",
      "word": "Breitensuche"
    },
    {
      "code": "is",
      "lang": "Icelandic",
      "sense": "a search algorithm",
      "tags": [
        "feminine"
      ],
      "word": "þverleit"
    },
    {
      "code": "is",
      "lang": "Icelandic",
      "sense": "a search algorithm",
      "tags": [
        "feminine"
      ],
      "word": "breiddarleit"
    },
    {
      "code": "it",
      "lang": "Italian",
      "sense": "a search algorithm",
      "tags": [
        "feminine"
      ],
      "word": "visita in ampiezza"
    },
    {
      "code": "pl",
      "lang": "Polish",
      "sense": "a search algorithm",
      "tags": [
        "neuter"
      ],
      "word": "przeszukiwanie wszerz"
    }
  ],
  "word": "breadth-first search"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-03 from the enwiktionary dump dated 2024-05-02 using wiktextract (f4fd8c9 and c9440ce). 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.