Graphical Program Merging with Readability Preservation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current technologies lack effective methods for merging graphical programs, which is challenging due to the spatial nature of graphical layouts and the presence of sub-VIs, making it difficult to implement functionalities like program merging and preserving readability in merged graphical programs.
Innovation Solution
A system and method for merging graphical programs by analyzing differences between two graphical programs, generating a merged graphical program that indicates differences, and intelligently placing program elements to preserve readability, using data structures and graphical user interface elements to display the merged program.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Extent of automation
If graphical programs are merged using traditional text-based merging methods, then the merging process can be automated, but the spatial layout and readability of graphical programs are lost
Solution Approach 1:
The graphical program is segmented into multiple layers including a graphical layout layer and a functional layer. This segmentation allows automated merging operations to work on the functional layer while preserving the graphical layout layer, thus achieving both automation and readability retention
Solution Approach 2:
The patent introduces a multi-layered structure that adds a vertical dimension to the traditional two-dimensional graphical layout. By separating graphical representation from functional content into different layers, the system enables automated merging in the functional layer without disrupting the spatial arrangement in the graphical layer
2Ease of operation
If graphical programs are merged by manually preserving spatial layout, then readability is maintained, but the merging process becomes complex and time-consuming
Solution Approach 1:
The graphical program is pre-processed into a multi-layered structure with distinct graphical and functional layers before merging. This preliminary organization enables subsequent automated merging operations to proceed efficiently without manual intervention, reducing merging time while preserving layout
3Reliability
If sub-VI (sub Virtual Instrument) structures are handled during merging, then functional completeness is improved, but the complexity of the merging algorithm increases significantly
Solution Approach 1:
The patent applies nesting by placing sub-VI structures within the multi-layered framework. Sub-VIs are handled as self-contained functional units within the functional layer, allowing complex nested structures to be merged systematically through recursive application of the merging algorithm at different levels of the hierarchy
Data Source
AI summary
System and method for merging differences between graphical programs. Information is received regarding matches and differences, e.g., in hardware, software, configuration, and/or connectivity, between first and second graphical programs, each comprising respective pluralities of interconnected nodes. The information is analyzed to merge differences between the first and second graphical programs, e.g., for each difference: removing all non-common nodes and connections thereto in the second sub-graph from the second graphical program, adding all common nodes and connections thereto in the first sub-graph to the second graphical program, determining all edges in the first sub-graph that connect common nodes to non-common nodes; and for each determined edge, adding to the second graphical program an edge that connects a corresponding common node in the second sub-graph with a corresponding non-common node added from the first sub-graph. A merged graphical program is displayed on a display, e.g., graphically indicating the merged matches and/or differences.