Control-flow graph
Graphical representation of a computer program or algorithm
Control-flow graph
In computer science, a control-flow graph (CFG) is a representation, using graph notation, of all paths that might be traversed through a function during its execution, or control flow. The control-flow graph was conceived by Frances E. Allen, who noted that Reese T. Prosser used boolean connectivity matrices for flow analysis before. The CFG is essential to many compiler optimizations and static-analysis tools.
Read on Wikipedia · Image Smitop and The Rust Project Developers, Apache License 2.0
Open boosters, collect cards and trade them. Free to play.
Play for free