Simplifying and reusing visual programming graphs
US10642580B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 20, 2016 |
| Grant date | May 5, 2020 |
| Priority date | — |
| Expiry date | Dec 4, 2036 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F8/36
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Techniques for simplifying and reusing visual programming graphs are described herein. In some examples, visual programming graphs may be simplified by decoupling execution signals from data resolution. Execution of a particular node may be triggered through a representation of a signal sent from a signal output slot of another node to a signal input slot on the node being triggered. Additionally, evaluation of data values may be represented by a connection between a data output slot on the node providing the data value to a data input slot on the node receiving the data value. Another technique for simplifying visual programming graphs may include combining and/or collapsing of multiple selected visual programming nodes into a single reusable visual programming node. In some examples, reusable combined visual programming nodes may be exposed using unlocked versions and/or locked versions.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.