【摘要】 基于程序拓扑结构,分析传统McCabe复杂性度量法,提出封闭区域个数统计法和判定结点个数统计法两种快速、直观、简便的计算方法,并提出路径复杂度算法,由此定义判定树类拓扑结构程序以路径数即分支数作为程序复杂度,同时提出了降低复杂度的程序设计方法,以实例进行对比验证,实践证明该方法简单、可行、有效.更多还原

【Abstract】 Based on topology structure of program,enclosed area integer counting method and determination point integer counting method which are fast,intuitive and simple are introduced by analyzing traditional McCabe method of complexity measure,and the path complexity measure algorithm is proposed,of which the branching number is taken as complexity measure of the program to determination tree topology.A programming method that reduces complexity of the program to determination tree topology is proposed,which is proved to be simple,feasible and effective.更多还原