Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Syed Zeeshan Husain"'
A graph theory based algorithm for the computation of cyclomatic complexity of software requirements
Publikováno v:
2017 International Conference on Computing, Communication and Automation (ICCCA).
Cyclomatic complexity (CC) is used to find out the number of independent paths in a program or software. In literature, different algorithms have been proposed to compute the CC of a program or software. In this paper, we proposed an algorithm for th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c1d0b043c24333b4fe39e9cf752732e9
https://doi.org/10.1109/ccaa.2017.8229931
https://doi.org/10.1109/ccaa.2017.8229931
