If a flowgraph have these values that R = 6, E = 21, N = 17, and P = 5. cyclomatic complexity metric (V(G)) will be code example

Example: what is cyclomatic complexity

Cyclomatic complexity = E - N + 2*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