See Eppstein's algorithm on Wiktionary
{
"etymology_text": "After US mathematician David Eppstein (born 1963).",
"head_templates": [
{
"args": {},
"expansion": "Eppstein'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": "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 finds a number of shortest paths (allowing cycles) connecting a given pair of vertices in a digraph."
],
"id": "en-Eppstein's_algorithm-en-name-UJJogAFW",
"links": [
[
"graph theory",
"graph theory"
],
[
"short",
"short"
],
[
"path",
"path"
],
[
"cycle",
"cycle"
],
[
"pair",
"pair"
],
[
"vertices",
"vertex"
],
[
"digraph",
"digraph"
]
],
"raw_glosses": [
"(graph theory) An algorithm that finds a number of shortest paths (allowing cycles) connecting a given pair of vertices in a digraph."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
],
"wikipedia": [
"David Eppstein"
]
}
],
"word": "Eppstein's algorithm"
}
{
"etymology_text": "After US mathematician David Eppstein (born 1963).",
"head_templates": [
{
"args": {},
"expansion": "Eppstein'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:Graph theory"
],
"glosses": [
"An algorithm that finds a number of shortest paths (allowing cycles) connecting a given pair of vertices in a digraph."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"short",
"short"
],
[
"path",
"path"
],
[
"cycle",
"cycle"
],
[
"pair",
"pair"
],
[
"vertices",
"vertex"
],
[
"digraph",
"digraph"
]
],
"raw_glosses": [
"(graph theory) An algorithm that finds a number of shortest paths (allowing cycles) connecting a given pair of vertices in a digraph."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
],
"wikipedia": [
"David Eppstein"
]
}
],
"word": "Eppstein's algorithm"
}
Download raw JSONL data for Eppstein's algorithm meaning in All languages combined (1.0kB)
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.