See Johnson's algorithm on Wiktionary
Download JSON data for Johnson's algorithm meaning in All languages combined (1.6kB)
{
"etymology_text": "Published in 1977 by Donald B. Johnson.",
"head_templates": [
{
"args": {},
"expansion": "Johnson'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 for finding the shortest paths between all pairs of vertices in an edge-weighted directed graph."
],
"id": "en-Johnson's_algorithm-en-name-DWpyB6uk",
"links": [
[
"graph theory",
"graph theory"
],
[
"path",
"path"
],
[
"pair",
"pair"
],
[
"vertices",
"vertex"
],
[
"directed graph",
"directed graph"
]
],
"raw_glosses": [
"(graph theory) An algorithm for finding the shortest paths between all pairs of vertices in an edge-weighted directed graph."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
],
"wikipedia": [
"Johnson's algorithm"
]
}
],
"word": "Johnson's algorithm"
}
{
"etymology_text": "Published in 1977 by Donald B. Johnson.",
"head_templates": [
{
"args": {},
"expansion": "Johnson'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 non-redundant non-automated sortkeys",
"English uncountable nouns",
"en:Graph theory"
],
"glosses": [
"An algorithm for finding the shortest paths between all pairs of vertices in an edge-weighted directed graph."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"path",
"path"
],
[
"pair",
"pair"
],
[
"vertices",
"vertex"
],
[
"directed graph",
"directed graph"
]
],
"raw_glosses": [
"(graph theory) An algorithm for finding the shortest paths between all pairs of vertices in an edge-weighted directed graph."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
],
"wikipedia": [
"Johnson's algorithm"
]
}
],
"word": "Johnson's algorithm"
}
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-05-09 from the enwiktionary dump dated 2024-05-02 using wiktextract (4d5d0bb and edd475d). 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.