"Dijkstra's algorithm" meaning in English

See Dijkstra's algorithm in All languages combined, or Wiktionary

Proper name

IPA: /ˈdaɪkstɹəz ˈælɡəɹɪðəm/ [UK]
Etymology: After its developer Edsger W. Dijkstra. Head templates: {{en-proper noun}} Dijkstra's algorithm
  1. (graph theory) An algorithm that computes single-source shortest paths in a weighted digraph. Wikipedia link: Dijkstra's algorithm, Edsger W. Dijkstra Categories (topical): Graph theory

Download JSONL data for Dijkstra's algorithm meaning in English (1.6kB)

{
  "etymology_text": "After its developer Edsger W. Dijkstra.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Dijkstra's 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": "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": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "An algorithm that computes single-source shortest paths in a weighted digraph."
      ],
      "id": "en-Dijkstra's_algorithm-en-name-oY5HICHn",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "path",
          "path"
        ],
        [
          "weighted",
          "weighted"
        ],
        [
          "digraph",
          "digraph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) An algorithm that computes single-source shortest paths in a weighted digraph."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Dijkstra's algorithm",
        "Edsger W. Dijkstra"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "/ˈdaɪkstɹəz ˈælɡəɹɪðəm/",
      "tags": [
        "UK"
      ]
    }
  ],
  "word": "Dijkstra's algorithm"
}
{
  "etymology_text": "After its developer Edsger W. Dijkstra.",
  "head_templates": [
    {
      "args": {},
      "expansion": "Dijkstra's algorithm",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms with IPA pronunciation",
        "English terms with non-redundant non-automated sortkeys",
        "English uncountable nouns",
        "en:Graph theory"
      ],
      "glosses": [
        "An algorithm that computes single-source shortest paths in a weighted digraph."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "algorithm",
          "algorithm"
        ],
        [
          "path",
          "path"
        ],
        [
          "weighted",
          "weighted"
        ],
        [
          "digraph",
          "digraph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) An algorithm that computes single-source shortest paths in a weighted digraph."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Dijkstra's algorithm",
        "Edsger W. Dijkstra"
      ]
    }
  ],
  "sounds": [
    {
      "ipa": "/ˈdaɪkstɹəz ˈælɡəɹɪðəm/",
      "tags": [
        "UK"
      ]
    }
  ],
  "word": "Dijkstra'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-06-27 from the enwiktionary dump dated 2024-06-20 using wiktextract (0f7b3ac and b863ecc). 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.