Control flow graph
![Some CFG examples:(a) an if-then-else(b) a while loop(c) a natural loop with two exits, e.g. while with an if...break in the middle; non-structured but reducible(d) an irreducible CFG: a loop with two entry points, e.g. goto into a while or for loop](/Images/godic/202501/06/Some_types_of_control_flow_graphs.svg1454.png")
![](/Images/godic/202501/06/Grafo_de_control_de_flujo1454.gif")
![](/Images/godic/202501/06/Directed_acyclic_graph.svg1454.png")
![](/Images/godic/202501/06/Directed_graph,_cyclic.svg1454.png")
A control flow graph (CFG) in computer science is a representation, using graph notation, of all paths that might be traversed through a program during its execution. The control flow graph is due to Frances E. Allen, who notes that Reese T. Prosser used boolean connectivity matrices for flow analysis before.