Prim's 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": "Named after computer scientist Robert C. Prim, who rediscovered and published it in 1957.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Prim'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"
        },
        {
          "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 greedy algorithm that finds a minimum spanning tree for a weighted undirected graph."
      ],
      "id": "en-Prim's_algorithm-en-name-kRjYZshf",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "greedy",
          "greedy"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "minimum spanning tree",
          "minimum spanning tree"
        ],
        [
          "weighted",
          "weighted"
        ],
        [
          "undirected graph",
          "undirected graph"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A greedy algorithm that finds a minimum spanning tree for a weighted undirected graph."
      ],
      "synonyms": [
        {
          "word": "DJP algorithm"
        },
        {
          "word": "Jarník's algorithm"
        },
        {
          "word": "Prim-Dijkstra algorithm"
        },
        {
          "word": "Prim-Jarník algorithm"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Robert C. Prim"
      ]
    }
  ],
  "word": "Prim's algorithm"
}

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

{
  "etymology_text": "Named after computer scientist Robert C. Prim, who rediscovered and published it in 1957.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Prim'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",
        "en:Theory of computing"
      ],
      "glosses": [
        "A greedy algorithm that finds a minimum spanning tree for a weighted undirected graph."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "greedy",
          "greedy"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "minimum spanning tree",
          "minimum spanning tree"
        ],
        [
          "weighted",
          "weighted"
        ],
        [
          "undirected graph",
          "undirected graph"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A greedy algorithm that finds a minimum spanning tree for a weighted undirected graph."
      ],
      "synonyms": [
        {
          "word": "DJP algorithm"
        },
        {
          "word": "Jarník's algorithm"
        },
        {
          "word": "Prim-Dijkstra algorithm"
        },
        {
          "word": "Prim-Jarník algorithm"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Robert C. Prim"
      ]
    }
  ],
  "word": "Prim's algorithm"
}

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

"Prim's algorithm" meaning in English

Proper name