Signal-flow graph: Difference between revisions

Content deleted Content added
Add: pmid, bibcode. Removed URL that duplicated unique identifier. Removed parameters. | You can use this tool yourself. Report bugs here. | via #UCB_Gadget
Soulera (talk | contribs)
Added flow graph software example
Tags: Mobile edit Mobile web edit
Line 1:
{{Redirect|Mason graph|other flow graphs|Flow graph (mathematics)}}
[[File:Spectrum trigger function.png|A modern flow graph based teal time spectrum analyzer software]]
 
A '''signal-flow graph''' or '''signal-flowgraph''' ('''SFG'''), invented by [[Claude Shannon]],<ref name =Shannon/> but often called a '''Mason graph''' after [[Samuel Jefferson Mason]] who coined the term,<ref name=Mason/> is a specialized [[Flow graph (mathematics)|flow graph]], a [[directed graph]] in which nodes represent system variables, and branches (edges, arcs, or arrows) represent functional connections between pairs of nodes. Thus, signal-flow graph theory builds on that of [[directed graph]]s (also called [[Digraph (mathematics)|digraph]]s), which includes as well that of [[Orientation (graph theory)#Oriented graphs|oriented graph]]s. This mathematical theory of digraphs exists, of course, quite apart from its applications.<ref name=Gutin>
{{cite book |title=Digraphs |url=https://books.google.com/books?id=5GdXCWhE4-MC&printsec=frontcover |author1=Jørgen Bang-Jensen |author2=Gregory Z. Gutin |year=2008 |publisher=Springer |isbn=9781848009981}}