See cyclomatic on Wiktionary
Download JSON data for cyclomatic meaning in All languages combined (4.2kB)
{
"derived": [
{
"_dis1": "0 0 0",
"word": "cocyclomatic"
},
{
"_dis1": "0 0 0",
"word": "cyclomatic complexity"
},
{
"_dis1": "0 0 0",
"word": "cyclomatic number"
}
],
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "cyclomatic (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"related": [
{
"_dis1": "0 0 0",
"word": "circuit rank"
}
],
"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": "39 15 46",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"glosses": [
"Used to describe the number of edges that must be removed from a graph to ensure that no graph cycle remains; equal to the number of edges, minus the number of nodes plus one."
],
"id": "en-cyclomatic-en-adj-Qb4slHCM",
"links": [
[
"graph theory",
"graph theory"
],
[
"number",
"number#English"
],
[
"edge",
"edge#English"
],
[
"graph",
"graph#English"
],
[
"cycle",
"cycle#English"
],
[
"node",
"node#English"
]
],
"raw_glosses": [
"(graph theory) Used to describe the number of edges that must be removed from a graph to ensure that no graph cycle remains; equal to the number of edges, minus the number of nodes plus one."
],
"tags": [
"not-comparable"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
],
"translations": [
{
"_dis1": "56 13 30",
"code": "fr",
"lang": "French",
"sense": "In graph theory",
"word": "cyclomatique"
},
{
"_dis1": "56 13 30",
"code": "de",
"lang": "German",
"sense": "In graph theory",
"word": "zyklomatisch"
}
]
},
{
"categories": [
{
"_dis": "39 15 46",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"glosses": [
"Used to describe the number of circuits in a network; equal to the number of edges, minus the number of nodes plus the number of graphs."
],
"id": "en-cyclomatic-en-adj-IbVYuzD-",
"links": [
[
"circuit",
"circuit#English"
],
[
"network",
"network#English"
]
],
"qualifier": "network analysis",
"raw_glosses": [
"(network analysis) Used to describe the number of circuits in a network; equal to the number of edges, minus the number of nodes plus the number of graphs."
],
"tags": [
"not-comparable"
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Software engineering",
"orig": "en:Software engineering",
"parents": [
"Computer science",
"Engineering",
"Software",
"Computing",
"Sciences",
"Applied sciences",
"Technology",
"Media",
"All topics",
"Communication",
"Fundamental"
],
"source": "w"
},
{
"_dis": "39 15 46",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
}
],
"examples": [
{
"ref": "2007, Yingxu Wang, Software Engineering Foundations: A Software Science Perspective, CRC Press, page 820",
"text": "This finding reveals that the drawing of a CFG for a given program or component is not necessary in the cyclomatic analysis.",
"type": "quotation"
}
],
"glosses": [
"Of or relating to a software metric that measures the complexity of a program based on the number of linearly independent paths through the source code."
],
"id": "en-cyclomatic-en-adj-wBW3BE~S",
"links": [
[
"software engineering",
"software engineering"
],
[
"software",
"software"
],
[
"metric",
"metric"
],
[
"complexity",
"complexity"
],
[
"program",
"program"
],
[
"path",
"path"
],
[
"source code",
"source code"
]
],
"raw_glosses": [
"(software engineering) Of or relating to a software metric that measures the complexity of a program based on the number of linearly independent paths through the source code."
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences",
"software"
],
"translations": [
{
"_dis1": "22 25 53",
"code": "de",
"lang": "German",
"sense": "In programming",
"word": "zyklomatisch"
}
]
}
],
"sounds": [
{
"ipa": "/ˌsaɪkləˈmætɪk/"
}
],
"word": "cyclomatic"
}
{
"categories": [
"English 4-syllable words",
"English adjectives",
"English entries with incorrect language header",
"English lemmas",
"English terms with IPA pronunciation",
"English uncomparable adjectives"
],
"derived": [
{
"word": "cocyclomatic"
},
{
"word": "cyclomatic complexity"
},
{
"word": "cyclomatic number"
}
],
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "cyclomatic (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"related": [
{
"word": "circuit rank"
}
],
"senses": [
{
"categories": [
"en:Graph theory"
],
"glosses": [
"Used to describe the number of edges that must be removed from a graph to ensure that no graph cycle remains; equal to the number of edges, minus the number of nodes plus one."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"number",
"number#English"
],
[
"edge",
"edge#English"
],
[
"graph",
"graph#English"
],
[
"cycle",
"cycle#English"
],
[
"node",
"node#English"
]
],
"raw_glosses": [
"(graph theory) Used to describe the number of edges that must be removed from a graph to ensure that no graph cycle remains; equal to the number of edges, minus the number of nodes plus one."
],
"tags": [
"not-comparable"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
},
{
"glosses": [
"Used to describe the number of circuits in a network; equal to the number of edges, minus the number of nodes plus the number of graphs."
],
"links": [
[
"circuit",
"circuit#English"
],
[
"network",
"network#English"
]
],
"qualifier": "network analysis",
"raw_glosses": [
"(network analysis) Used to describe the number of circuits in a network; equal to the number of edges, minus the number of nodes plus the number of graphs."
],
"tags": [
"not-comparable"
]
},
{
"categories": [
"English terms with quotations",
"en:Software engineering"
],
"examples": [
{
"ref": "2007, Yingxu Wang, Software Engineering Foundations: A Software Science Perspective, CRC Press, page 820",
"text": "This finding reveals that the drawing of a CFG for a given program or component is not necessary in the cyclomatic analysis.",
"type": "quotation"
}
],
"glosses": [
"Of or relating to a software metric that measures the complexity of a program based on the number of linearly independent paths through the source code."
],
"links": [
[
"software engineering",
"software engineering"
],
[
"software",
"software"
],
[
"metric",
"metric"
],
[
"complexity",
"complexity"
],
[
"program",
"program"
],
[
"path",
"path"
],
[
"source code",
"source code"
]
],
"raw_glosses": [
"(software engineering) Of or relating to a software metric that measures the complexity of a program based on the number of linearly independent paths through the source code."
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences",
"software"
]
}
],
"sounds": [
{
"ipa": "/ˌsaɪkləˈmætɪk/"
}
],
"translations": [
{
"code": "fr",
"lang": "French",
"sense": "In graph theory",
"word": "cyclomatique"
},
{
"code": "de",
"lang": "German",
"sense": "In graph theory",
"word": "zyklomatisch"
},
{
"code": "de",
"lang": "German",
"sense": "In programming",
"word": "zyklomatisch"
}
],
"word": "cyclomatic"
}
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-01 from the enwiktionary dump dated 2024-04-21 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.