A directed graph representing the sequence of execution in a program unit, in which nodes represent branching points or subprogram calls in a program, and arcs represent linear sequences of code. From the control-flow graph an analysis can show

• the structure of the program,

• starts and ends of program segments,

• unreachable code and dynamic halts,

• branches from within loops,

• entry and exit points for loops,

• paths through the program.

See also static analysis.