See strongly connected on Wiktionary
Download JSON data for strongly connected meaning in All languages combined (3.1kB)
{
"derived": [
{
"_dis1": "48 52",
"word": "strongly connected component"
}
],
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "strongly connected (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"categories": [
{
"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"
},
{
"_dis": "50 50",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "50 50",
"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+disamb"
},
{
"_dis": "50 50",
"kind": "other",
"name": "English terms with non-redundant non-automated sortkeys",
"parents": [
"Terms with non-redundant non-automated sortkeys",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"glosses": [
"Of a directed graph, such that for every pair of vertices u and v there is a path from u to v and a path from v to u."
],
"id": "en-strongly_connected-en-adj-HMdOelX5",
"links": [
[
"graph theory",
"graph theory"
],
[
"directed graph",
"directed graph"
]
],
"raw_glosses": [
"(graph theory) Of a directed graph, such that for every pair of vertices u and v there is a path from u to v and a path from v to u."
],
"tags": [
"not-comparable"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
},
{
"categories": [
{
"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"
},
{
"_dis": "50 50",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "50 50",
"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+disamb"
},
{
"_dis": "50 50",
"kind": "other",
"name": "English terms with non-redundant non-automated sortkeys",
"parents": [
"Terms with non-redundant non-automated sortkeys",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"glosses": [
"Of a directed graph, such that for every pair of vertices u and v there is a directed path either from u to v or from v to u."
],
"id": "en-strongly_connected-en-adj-IudPjin~",
"links": [
[
"graph theory",
"graph theory"
],
[
"directed graph",
"directed graph"
],
[
"directed path",
"directed path"
]
],
"raw_glosses": [
"(graph theory) Of a directed graph, such that for every pair of vertices u and v there is a directed path either from u to v or from v to u."
],
"tags": [
"not-comparable"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"wikipedia": [
"Strongly connected component"
],
"word": "strongly connected"
}
{
"categories": [
"English adjectives",
"English adverb-adjective phrases",
"English entries with incorrect language header",
"English entries with language name categories using raw markup",
"English lemmas",
"English multiword terms",
"English terms with non-redundant non-automated sortkeys",
"English uncomparable adjectives"
],
"derived": [
{
"word": "strongly connected component"
}
],
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "strongly connected (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"categories": [
"en:Graph theory"
],
"glosses": [
"Of a directed graph, such that for every pair of vertices u and v there is a path from u to v and a path from v to u."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"directed graph",
"directed graph"
]
],
"raw_glosses": [
"(graph theory) Of a directed graph, such that for every pair of vertices u and v there is a path from u to v and a path from v to u."
],
"tags": [
"not-comparable"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
},
{
"categories": [
"en:Graph theory"
],
"glosses": [
"Of a directed graph, such that for every pair of vertices u and v there is a directed path either from u to v or from v to u."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"directed graph",
"directed graph"
],
[
"directed path",
"directed path"
]
],
"raw_glosses": [
"(graph theory) Of a directed graph, such that for every pair of vertices u and v there is a directed path either from u to v or from v to u."
],
"tags": [
"not-comparable"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"wikipedia": [
"Strongly connected component"
],
"word": "strongly connected"
}
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-03 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.