Skip to content

Glossary

Control Flow Graph (CFG)

A directed graph representing all possible execution paths through a function, with nodes as basic blocks and edges as branches.

A Control Flow Graph (CFG) is a directed graph in which each node is a basic block (a straight-line sequence of instructions with no branches in the middle) and each edge represents a possible transfer of control (conditional jump, unconditional jump, or fall-through). CFGs are generated automatically by disassemblers like IDA Pro and Ghidra and displayed as graph views. They make it easy to see loops, if-else chains, and switch tables at a glance. CFG analysis underpins many automated techniques including symbolic execution and code-coverage tracking during fuzzing.