See Suurballe's algorithm on Wiktionary
{
"etymology_text": "Devised by John W. Suurballe and published in 1974.",
"head_templates": [
{
"args": {
"head": "Suurballe's algorithm"
},
"expansion": "Suurballe'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": "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": [
"An algorithm for finding two disjoint paths in a non-negatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length."
],
"id": "en-Suurballe's_algorithm-en-name-r9aun9Xg",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"disjoint",
"disjoint"
],
[
"path",
"path"
],
[
"directed graph",
"directed graph"
],
[
"vertices",
"vertex"
]
],
"raw_glosses": [
"(computing theory) An algorithm for finding two disjoint paths in a non-negatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Suurballe's algorithm"
]
}
],
"word": "Suurballe's algorithm"
}
{
"etymology_text": "Devised by John W. Suurballe and published in 1974.",
"head_templates": [
{
"args": {
"head": "Suurballe's algorithm"
},
"expansion": "Suurballe's algorithm",
"name": "en-proper noun"
}
],
"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": [
"An algorithm for finding two disjoint paths in a non-negatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"disjoint",
"disjoint"
],
[
"path",
"path"
],
[
"directed graph",
"directed graph"
],
[
"vertices",
"vertex"
]
],
"raw_glosses": [
"(computing theory) An algorithm for finding two disjoint paths in a non-negatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"Suurballe's algorithm"
]
}
],
"word": "Suurballe's algorithm"
}
Download raw JSONL data for Suurballe's algorithm meaning in All languages combined (1.3kB)
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.