Discussion
Suppose a graph has 5 flow graph edges and 3 flow graph modes, the cyclometric complexity V(G) of flow graph G is ..............
Answer: C
The cyclomatic complexity is 4.
For a flow graph with E edges and N nodes (the paper's 'modes'), McCabe's measure is
\[ \begin{aligned} V(G) &= E - N + 2 \\ &= 5 - 3 + 2 = 4 \end{aligned} \]
-2 is what you get by computing N - E, 2 omits the edges and nodes difference, and 8 adds E and N.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development