Research any topic before you write.

Find related topics. | Discover entities. | See connections. | Build a topical map.

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.

Science, Reachability & Examples

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Research this topic

Explore the main themes, entities and connections around Control-flow graph. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

Definition

Examples

Construction

Reachability

Dominance relationships

Special edges

Strongly-connected components

Loop management

Reducibility

Loop connectedness

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

Control-flow graph

Nodes50
Edges49
Triples11
Avg. degree1.96
Density0.04
Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

Control-flow graph

Top relations

related to Inter-procedural control-flow graph · 1
Control-flow graph → While

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

block blocks graph flow control cfg loop exit basic function edge edges entry program dominator control-flow dominates reachable called source

Entity relationships Subject–Predicate–Object triples

SubjectPredicateObjectConfidenceSrc
shadowinginstance ofThis would cause difficulties for scope-driven features0.80text
variable-length arraysinstance ofThis would cause difficulties for scope-driven features0.80text
LLVM use a CFG in which basic blocks consist of abstract static single-assignment instructions as their primary IRinstance ofcompiler frameworks0.80text
IFinstance ofand common structured programming statements0.80text
FORinstance ofand common structured programming statements0.80text
WHILEinstance ofand common structured programming statements0.80text
BREAKinstance ofand common structured programming statements0.80text
and CONTINUE reliably produce reducible graphsinstance ofand common structured programming statements0.80text
GOTO are needed that can jump to an arbitrary point in the programinstance ofstatements0.80text
although not all uses of GOTO produce irreducible CFGsinstance ofstatements0.80text
Control-flow graphrelated to Inter-procedural control-flow graphWhile0.60section

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

    Connections between topic areas Semantic bridges

    Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

    Min side: 3
    For writers, content strategists, SEOs, marketers and creators — from quick topic research to advanced semantic analysis.