Difference between revisions of "Flow graph (mathematics)"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) |
Karl Jones (Talk | contribs) |
||
| Line 1: | Line 1: | ||
| − | In [[graph theory]], a '''flow graph''' is a form of [[digraph]] associated with a set of linear algebraic or differential equations. | + | In [[graph theory]], a '''flow graph''' is a form of [[digraph]] associated with a set of [[linear algebraic]] or [[differential equations]]. |
== Description == | == Description == | ||
Revision as of 04:57, 28 May 2016
In graph theory, a flow graph is a form of digraph associated with a set of linear algebraic or differential equations.
Description
Abrahams and Coverley write:
A signal flow graph is a network of nodes (or points) interconnected by directed branches, representing a set of linear algebraic equations. The nodes in a flow graph are used to represent the variables, or parameters, and the connecting branches represent the coefficients relating these variables to one another. The flow graph is associated with a number of simple rules which enable every possible solution [related to the equations] to be obtained.
Source: J. R. Abrahams, G. P. Coverley (2014). "Chapter 1: Elements of a flow graph". Signal flow analysis. Elsevier. p. 1. ISBN 9781483180700.
See also
External links
- Flow graph (mathematics) @ Wikipedia
