Jump to content

Flow graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Narky Blert (talk | contribs) at 17:38, 13 September 2016 (One link/line). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Flow graph may refer to:

  • Rooted graph (also known as flow graph), a graph in which a vertex has been distinguished as the root.
    • Control flow graph, a rooted directed graph used in computer science as a representation of the paths that might be traversed through a program during its execution.
  • Flow graph (mathematics), a directed graph associated with a set of linear algebraic or differential equations.
  • Signal-flow graph, a directed graph in which nodes represent system variables and arrows represent functional connections between pairs of nodes.

Related terms are: