什么是OOAD中的圈复杂度测试 [英] What is Cyclomatic complexity testing in OOAD

问题描述

大家好，
我是哎呀的新蜜蜂，我想进一步了解环复杂性吗?
请帮助我.

Hi all,
I''m new bees in oops i want to know more about Cyclomatic complexity ?
Help me please.

推荐答案

然后 google [ ^ ]并阅读！


http://en.wikipedia.org/wiki/Cyclomatic_complexity [ http://www.ibm.com/developerworks/java/library/j-cq03316/ [^ ]

用于Microsoft .NET应用程序的代码复杂度分析 [ http://c2.com/cgi/wiki?CyclomaticComplexityMetric [

Well then google[^] and read!


http://en.wikipedia.org/wiki/Cyclomatic_complexity[^]

http://www.ibm.com/developerworks/java/library/j-cq03316/[^]

Cyclomatic Code Complexity Analysis for Microsoft .NET Applications[^]

http://c2.com/cgi/wiki?CyclomaticComplexityMetric[^]

首先尝试使用google询问此问题，然后再问问题，
什么是圈复杂度? [ ^ ]
基本上，圈复杂度测试技术用于确保必须对软件的每个部分进行测试.
找到圈复杂度
有三种方式

First try google for this then asked question,
What is cyclomatic complexity?[^]
Basically cyclomatic complexity testing techanique is used to insure that every part of software must tested.
to find of cyclomatic complexity
there are three way

1)FLOW GRAPH<br />
2)By using Edges and nodes<br />
   E(edges)-N(Nodes)+2<br />
3)By using Predicted nodes<br />
   Predicted nodes+1

基本上，它是一种软件度量标准，用于分析程序的执行路径，查看执行的循环和线性行.

你可以在这里阅读更多; http://en.wikipedia.org/wiki/Cyclomatic_complexity [

It is basically a software metric used to analyse the execution path of programs, looking at loops and linear lines of execution.

You can read more here; http://en.wikipedia.org/wiki/Cyclomatic_complexity[^]

这篇关于什么是OOAD中的圈复杂度测试的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！