Jump to content

Flow graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Esponenziale (talk | contribs) at 17:03, 15 August 2016 (Disambiguation page created). 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 digraph in which a vertex has been distinguished as the root.
    • Control flow graph, a rooted digraphs used in computer science as a representation of the paths that might be traversed through a program during its execution.
  • Flow graph (mathematics), a digraph associated with a set of linear algebraic or differential equations.

Related terms are:

  • Signal-flow graph, a directed graph in which nodes represent system variables and arrows represent functional connections between pairs of nodes.
  • Flow network, a weighted directed graphs where two nodes are distinguished, a source and a sink.
  • Flow diagram
  • Flow chart