Excerpt from Cyclomatic Complexity Metrics Revisited: An Empirical Study of Software Development and Maintenance
Mccabe [1976] proposed that a measure of the complexity is the number of possible paths through which the software could execute. Since the number of paths in a program with a backward branch is infinite, he proposed that a reasonable measure would be the number of independent paths.
After defining the program graph for a given program, the complexity calculation would be.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
(nessuna copia disponibile)
Cerca: Inserisci un desiderataNon riesci a trovare il libro che stai cercando? Continueremo a cercarlo per te. Se uno dei nostri librai lo aggiunge ad AbeBooks, ti invieremo una notifica!
Inserisci un desiderata