ããã±ã¼ãã®å¾ªç°çè¤é度 (McCabe's cyclomatic complexity) ï¼ï¼å¾ªç°çè¤é度ã¨ã¯ e: ããã°ã©ã ä¸ã«åå¨ããåºæ¬ããã㯠åºæ¬ãããã¯ï¼åå²ã¨åæµãå«ã¾ãªãè¨ç®éç¨ï¼å³ï¼ã§ã¯ç¢å°é¨åï¼ n: ããã°ã©ã ä¸ã«åå¨ããåå²ç¹ã¨åæµç¹ã®æ° åå²ç¹ï¼if ã while æï¼åæµç¹ï¼if æã®çµããï¼while æã®çµãã å³ï¼ã§ã¯ï¼â¯å°é¨åï¼ p: ãµãã«ã¼ãã³æ°(å«ãèªåèªèº«ã®ã«ã¼ãã³) ã¨ããã¨ï¼è¤é度 C ã¯ä»¥ä¸ã®ããã«è¨ç®ããï¼å³ï¼ã®å ´åï¼ï¼ã¤ã®éé å (丸æ°åã® 1 - 3) ã¨ï¼ã¤ã®éé å (丸æ°åã® 4) ãæ°ããçµæã表ãã¾ãï¼
Cyclomatic complexity is a software metric used to indicate the complexity of a program. It is a quantitative measure of the number of linearly independent paths through a program's source code. It was developed by Thomas J. McCabe, Sr. in 1976. 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 pr
ãªãªã¼ã¹ãé害æ å ±ãªã©ã®ãµã¼ãã¹ã®ãç¥ãã
ææ°ã®äººæ°ã¨ã³ããªã¼ã®é ä¿¡
å¦çãå®è¡ä¸ã§ã
j次ã®ããã¯ãã¼ã¯
kåã®ããã¯ãã¼ã¯
lãã¨ã§èªã
eã³ã¡ã³ãä¸è¦§ãéã
oãã¼ã¸ãéã
{{#tags}}- {{label}}
{{/tags}}