循環複雜性 - 爲此java語句繪製控制流圖

Question

任何人都可以幫忙嗎？

while (x > level) 
    x = x – 1; 
x = 0 

Answer 1

環複雜度可以使用提供的公式here來計算。

Cyclomatic complexity = E - N + P 
where, 
    E = number of edges in the flow graph. 
    N = number of nodes in the flow graph. 
    P = number of nodes that have exit points 

對於你的情況，該圖應該是這樣的：

---------------    ---------- 
| x > level |----- NO ------>| x = x-1| 
|-------------|    ----|----- 
     |  |--------------------- 
     | 
     Yes 
     | 
-------|---------- 
| End while (if) | 
-------|---------- 
     | 
     | 
    --------- 
    | x = 0 | 
    ---------- 

（非ASCII藝術人）

因此，cyclomatic complexity應該是：

E = 4, N = 4, P = 2 => Complexity = 4 - 4 + 2 = 2 

[編輯] Ira Baxter指出很好如何簡化這種計算的語言，如Java，C#，C++等。然而，識別條件語句必須小心，如圖所示here：

- Start with a count of one for the method. 
- Add one for each of the following flow-related elements that are found in the method. 
    Returns - Each return that isn't the last statement of a method. 
    Selection - if, else, case, default. 
    Loops - for, while, do-while, break, and continue. 
    Operators - &&, ||, ?, and : 
    Exceptions - catch, finally, throw, or throws clause.