Editing LabVIEW (section)

== Dataflow programming ==
The programming paradigm used in the LabVIEW "G" language is based on data availability. If there is enough data available to a function, it will execute. The execution flow is determined by the structure of a graphical block diagram (the LabVIEW-source code) on which the programmer places ''nodes'' and connects them by drawing ''wires''. A node can be a ''control'', ''indicator'', ''structure'', ''function,'' or recursively, ''another block diagram''. An example of a simple four-node block diagram is two controls and an indicator wired to the addition function, causing the indicator to display the sum of the two controls. The wires connecting nodes propagate data as variables, and any node can execute as soon as all its input variables (data) become available. Since this might be the case for multiple nodes simultaneously, LabVIEW can conceptually execute in parallel.<ref name=bress2013>{{cite book|last1=Bress|first1=Thomas J.|title=Effective LabVIEW Programming|date=2013|publisher=NTS Press|location=[S.l.]|isbn=978-1-934891-08-7}}</ref>{{rp|1–2}} [[Multi-processing]] and [[Thread (computer science)|multi-threading]] hardware is exploited automatically by the built-in scheduler, which [[multiplexing|multiplexes]] multiple OS threads over the nodes ready for execution.