本文介绍了圈复杂度（Cyclomatic Complexity）的概念及其计算公式：M=E-N+2P，其中E为图的边数，N为节点数，P为连通组件数。根据圈复杂度的不同范围，软件应用被分为正常、中等、风险及不稳定四个等级。
Cyclomatic Complexity(圈复杂度)
M=E-N+2P;
M=CC
E=the number of Edges of the graph
N=the number of nodes of the graph
P=the number of connected components
CC lies 1-10:To be considered Normal application
CC lies 11-20:Moderate application
CC lies 21-50:Risky application
CC lies more than 50:Unstable application
M=E-N+2P;
M=CC
E=the number of Edges of the graph
N=the number of nodes of the graph
P=the number of connected components
CC lies 1-10:To be considered Normal application
CC lies 11-20:Moderate application
CC lies 21-50:Risky application
CC lies more than 50:Unstable application
扫一扫
1440
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
