- cyclomatic number
- т.граф. цикломатическое число
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
cyclomatic number — the number of circuits in a network … Geography glossary
Cyclomatic complexity — (or conditional complexity) is a software metric (measurement). It was developed by Thomas J. McCabe, Sr. in 1976 and is used to indicate the complexity of a program. It directly measures the number of linearly independent paths through a program … Wikipedia
Betti number — In algebraic topology, the Betti number of a topological space is, in intuitive terms, a way of counting the maximum number of cuts that can be made without dividing the space into two pieces. This defines, in fact, what is called the first Betti … Wikipedia
Circuit rank — The circuit rank of a graph G (also known as the cyclomatic number of G) is the minimum number r of edges to remove from the graph to make it cycle free. It has the formula r = m − n + c, where m is the number |E(G)| of edges in G, n is the… … Wikipedia
alpha index — a measure of connectivity in a network. Expresses the cyclomatic number as a percentage of the maximum possible circuits. A low percentage indicates low connectivity. Formula is: α = (e v+1) x 100 2v 5 where e is number of edges and v is number … Geography glossary
connectivity — the extent to which points, or nodes, in a network may be interconnected and thus a measure of the network efficiency in allowing transfers in space or time. See alpha index, beta index, cyclomatic number, detour index and gamma index for… … Geography glossary
Ц — Целевая программа, целевая комплексная программа (ЦКП) [goal related program] Целевая сумма прибыли (target profit, purpose oriented profit) Целевая функция [target function] в экстремальных задачах … Экономико-математический словарь
цикломатическое число — Термин теории графов, одна из возможных числовых характеристик несвязного графа. Если граф X имеет n вершин, m ребер, а p количество его связных частей компонент (см. Граф), то Ц.ч. определяется равенством v(X) = m n + p. При Ц.ч., равном нулю,… … Справочник технического переводчика
Цикломатическая сложность — программы (англ. Cyclomatic complexity of a program) структурная (или топологическая) мера сложности программ, используемая для измерения качества программного обеспечения, основанная на методах статического анализа кода. ЦСП равна… … Википедия
Software Quality Model — Software quality can be defined as conformance to requirements and/or fitness of use . Quality achievements start with a loud and clear definition of what quality of source code means to your organization or project. In simple terms all the… … Wikipedia
Software metric — A software metric is a measure of some property of a piece of software or its specifications.Since quantitative methods have proved so powerful in the other sciences, computer science practitioners and theoreticians have worked hard to bring… … Wikipedia