for a particular flow diagram it is the no of conditions+1

Cyclomatic complexity is the most widely used member of a
class of static software metrics.
Cyclomatic complexity may be considered a broad measure of
soundness and confidence for a program.It is often used in
concert with other software metrics. As one of the more
widely-accepted software metrics it is intended to be
independent of language and language format.
Cyclomatic complexity has also been extended to encompass
the design and structural complexity of a system.
The cyclomatic complexity of a software module is calculated
from a connected graph of the module

Cyclometric complexity or conditional complexity is 
software metric used to measure the complexity of the 
software program.It measures the linear independent paths 
that passes through the program source code.

formula for cuclometric complexity is 
M= E-N+2P

Where M is cyclometric complexity
E is the number of the edges in the graph
N is the number of the nodes in the graph
P is the number of connected components