Cyclometric complexity of a flow graph G with n vertices and e edges is
2013
Cyclometric complexity of a flow graph G with n vertices and e edges is
- A.
V(G) = e + n − 2
- B.
V(G) = e − n + 2
- C.
V(G) = e + n + 2
- D.
V(G) = e − n − 2
Attempted by 90 students.
Show answer & explanation
Correct answer: B
Cyclomatic complexity determines the number of independent paths in a flow graph. The standard formula for a connected graph is V(G) = e - n + 2, where e is edges and n is vertices.
A video solution is available for this question — log in and enroll to watch it.