See topological sort in All languages combined, or Wiktionary
Download JSON data for topological sort meaning in English (1.6kB)
{
"forms": [
{
"form": "topological sorts",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "topological sort (plural topological sorts)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Computer science",
"orig": "en:Computer science",
"parents": [
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"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 ordering of the vertices of a directed graph such that if an edge goes from vertex u to vertex v then u precedes v in the ordering."
],
"id": "en-topological_sort-en-noun-pxeHxbWX",
"links": [
[
"graph theory",
"graph theory"
],
[
"computer science",
"computer science"
],
[
"ordering",
"ordering"
],
[
"vertices",
"vertex"
],
[
"directed graph",
"directed graph"
]
],
"raw_glosses": [
"(graph theory, computer science) An ordering of the vertices of a directed graph such that if an edge goes from vertex u to vertex v then u precedes v in the ordering."
],
"topics": [
"computer",
"computing",
"engineering",
"graph-theory",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "topological sort"
}
{
"forms": [
{
"form": "topological sorts",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "topological sort (plural topological sorts)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"en:Computer science",
"en:Graph theory"
],
"glosses": [
"An ordering of the vertices of a directed graph such that if an edge goes from vertex u to vertex v then u precedes v in the ordering."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"computer science",
"computer science"
],
[
"ordering",
"ordering"
],
[
"vertices",
"vertex"
],
[
"directed graph",
"directed graph"
]
],
"raw_glosses": [
"(graph theory, computer science) An ordering of the vertices of a directed graph such that if an edge goes from vertex u to vertex v then u precedes v in the ordering."
],
"topics": [
"computer",
"computing",
"engineering",
"graph-theory",
"mathematics",
"natural-sciences",
"physical-sciences",
"science",
"sciences"
]
}
],
"word": "topological sort"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-05 from the enwiktionary dump dated 2024-05-02 using wiktextract (f4fd8c9 and c9440ce). 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.