control flow graph

control flow graph

[kən¦trōl ′flō ‚graf]

(computer science)

A graph describing the logic structure of a software module, in which the nodes represent computational statements or expressions, the edges represent transfer of control between nodes, and each possible execution path of the module has a corresponding path from the entry to the exit node of the graph.

McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.

control flow graph

A pictorial representation of the logic in a software module. The module must have an entry and exit point and be callable by another program.

Copyright © 1981-2025 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.