8 %7

2009 7

Software Guide

Vol.8 No.7
Jul. 2009

571400

TP311.11

1672-7800 2009 07001003

1.1

1.2

1982 .NET
1961
1983 .NET

4
1

P
P 1
2 VGEN2P10725 5
2

11

V G ENP

1 2

Thomas J.McCabe

6 1 3 ii

FleschKincaid

MENP11715
3

V G R R

2 e1 e2

1 2

4
2

2.1

5 5

4 1

V G P1

V G EN2P
V G

P
2

1 2 3 4 V G P

1415

12

2.2

2010

void Do int X int A int B

if A1 B0

1
A

XX A
if A2 X1

Void Do int X int A int B

XX1

if AB

B if

XX A

6 7

XX1

i V G EN2P

11825
2.3

CASE ifelse ifelse

CASE if else if

V G i
5

A 5 5

V G en2p

1 3 4 2
2

. J . 2007
11 .

Ron Patton. M .2006.

. M .

. M . 2007 9 .

2007.
6

Cyclomatic Complexity Calculation in Basic Path Testing Method

Abstract Software testing is an important part of the software development process it runs through the entire process.In the software
testing methods the white-box testing and black-box testing are often used in testing technology.In white-box testing methods the Basic
path testing is the most effective method to solve complex path testing.Further in the basic path testing method the calculation of cyclomatic complexity is a very important process.Practical experience shows that the program deficiencies may exist related to the number of
cyclomatic complexity in this article the author explore how to correctly cyclomatic complexity calculate in using basic path testing
method.
Key Words Software Testing Control Flow Graph Basic Path Independent Path Decomposition Cyclomatic Complexity