Cyclomatic complexity
Cyclomatic complexity is computed using the control flow graph of the program: the nodes of the graph correspond to indivisible groups of commands of a program , and a directed edge connects two nodes if the second command might be executed immediately after the first command . 
<triplet> directed <subj> graph <obj> subclass of