Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Cyclomatic_complexity> ?p ?o. }
Showing items 1 to 40 of
40
with 100 items per page.
- Cyclomatic_complexity abstract "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 is a quantitative measure of logical strength of the program. It directly measures the number of linearly independent paths through a program's source code. The concept, although not the method, is somewhat similar to that of general text complexity measured by the Flesch-Kincaid Readability Test.Cyclomatic complexity is computed using the control flow graph of the program: the nodes of the graph correspond to indivisible groups of commands of a program, and a directed edge connects two nodes if the second command might be executed immediately after the first command. Cyclomatic complexity may also be applied to individual functions, modules, methods or classes within a program.One testing strategy, called Basis path testing by McCabe who first proposed it, is to test each linearly independent path through the program; in this case, the number of test cases will equal the cyclomatic complexity of the program.".
- Cyclomatic_complexity thumbnail Control_flow_graph_of_function_with_loop_and_an_if_statement_without_loop_back.svg?width=300.
- Cyclomatic_complexity wikiPageExternalLink strtest.html.
- Cyclomatic_complexity wikiPageExternalLink TAIC2008-29-08-2008.pdf.
- Cyclomatic_complexity wikiPageExternalLink mccabe.pdf.
- Cyclomatic_complexity wikiPageExternalLink cyclomatic-complexity.html.
- Cyclomatic_complexity wikiPageExternalLink non-linear-paths-from-application-code.
- Cyclomatic_complexity wikiPageExternalLink maltapplication.
- Cyclomatic_complexity wikiPageID "1014906".
- Cyclomatic_complexity wikiPageRevisionID "606784369".
- Cyclomatic_complexity date "November 2013".
- Cyclomatic_complexity hasPhotoCollection Cyclomatic_complexity.
- Cyclomatic_complexity reason "something is missing here".
- Cyclomatic_complexity subject Category:Software_metrics.
- Cyclomatic_complexity comment "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 is a quantitative measure of logical strength of the program. It directly measures the number of linearly independent paths through a program's source code.".
- Cyclomatic_complexity label "Complejidad ciclomática".
- Cyclomatic_complexity label "Complessità ciclomatica".
- Cyclomatic_complexity label "Complexidade ciclomática".
- Cyclomatic_complexity label "Cyclomatic complexity".
- Cyclomatic_complexity label "McCabe-Metrik".
- Cyclomatic_complexity label "Nombre cyclomatique".
- Cyclomatic_complexity label "Złożoność cyklomatyczna".
- Cyclomatic_complexity label "Цикломатическая сложность".
- Cyclomatic_complexity label "مقياس مكابي".
- Cyclomatic_complexity label "循環的複雑度".
- Cyclomatic_complexity label "循環複雜度".
- Cyclomatic_complexity sameAs Cyklomatická_složitost.
- Cyclomatic_complexity sameAs McCabe-Metrik.
- Cyclomatic_complexity sameAs Complejidad_ciclomática.
- Cyclomatic_complexity sameAs Nombre_cyclomatique.
- Cyclomatic_complexity sameAs Complessità_ciclomatica.
- Cyclomatic_complexity sameAs 循環的複雑度.
- Cyclomatic_complexity sameAs Złożoność_cyklomatyczna.
- Cyclomatic_complexity sameAs Complexidade_ciclomática.
- Cyclomatic_complexity sameAs m.03zc97.
- Cyclomatic_complexity sameAs Q867330.
- Cyclomatic_complexity sameAs Q867330.
- Cyclomatic_complexity wasDerivedFrom Cyclomatic_complexity?oldid=606784369.
- Cyclomatic_complexity depiction Control_flow_graph_of_function_with_loop_and_an_if_statement_without_loop_back.svg.
- Cyclomatic_complexity isPrimaryTopicOf Cyclomatic_complexity.
