"Kruskal's algorithm" meaning in All languages combined

See Kruskal's algorithm on Wiktionary

Proper name [English]

Head templates: {{en-prop}} Kruskal's algorithm
  1. An algorithm in discrete mathematics/graph theory that is used to generate the minumum spanning tree in a given direction of two paths. It translates a forest from the nodes in the graph, considering each node as its own tree.
    Sense id: en-Kruskal's_algorithm-en-name-dk08SDa~ Categories (other): English entries with incorrect language header, Pages with 1 entry, Pages with entries
     
{
  "head_templates": [
    {
      "args": {},
      "expansion": "Kruskal's algorithm",
      "name": "en-prop"
    }
  ],
  "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": [
        "An algorithm in discrete mathematics/graph theory that is used to generate the minumum spanning tree in a given direction of two paths. It translates a forest from the nodes in the graph, considering each node as its own tree."
      ],
      "id": "en-Kruskal's_algorithm-en-name-dk08SDa~"
    }
  ],
  "word": "Kruskal's algorithm"
}

{
  "head_templates": [
    {
      "args": {},
      "expansion": "Kruskal's algorithm",
      "name": "en-prop"
    }
  ],
  "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": [
        "An algorithm in discrete mathematics/graph theory that is used to generate the minumum spanning tree in a given direction of two paths. It translates a forest from the nodes in the graph, considering each node as its own tree."
      ]
    }
  ],
  "word": "Kruskal's algorithm"
}

Download raw JSONL data for Kruskal's algorithm meaning in All languages combined (0.6kB)

This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-21 from the enwiktionary dump dated 2024-12-04 using wiktextract (d8cb2f3 and 4e554ae). 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.