Final answer:
In McCabe's cyclomatic complexity, E and N in the formula V(G)= E-N+2p represent the number of edges and nodes in the control flow graph of a program, essential for determining the program's complexity.
Step-by-step explanation:
In McCabe's cyclomatic complexity, in the formula V(G)= E-N+2p, E and N are the number of edges and nodes in the control flow graph for the program. The cyclomatic complexity is a software metric used to measure the complexity of a program. It helps in determining the number of linearly independent paths through a program's source code.
The control flow graph (CFG) is a graphical representation of all paths that might be traversed through a program during its execution. In the context of this formula, E stands for the total number of edges, which represent the flow of control from one part of the program to another. N is the total number of nodes, which correspond to blocks of the program, such as statements or function calls. The variable p represents the number of connected components in the graph, often p=1 for a single program.