Visualization graph procedure topology sorting method

A topology sorting and graph technology, applied in the field of visual programming, can solve the problem of large workload of setting and maintenance, and achieve the effect of reducing workload and improving application effect.

Active Publication Date: 2013-07-17
NR ELECTRIC CO LTD +1
View PDF3 Cites 17 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The problem with manually specifying the order is that when there are many visualization pages, the workload of setting and maintenance is very large. For example, when a symbol is inserted in the middle of programming, the sorting value of subsequent symbols needs to be manually adjusted
At present, there is still a lack of effective and reasonable intelligent solutions for visual closed-loop graphics programs. For this purpose, a broken-loop symbol is designed, and the broken-loop point is designated by the program editor

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Visualization graph procedure topology sorting method
  • Visualization graph procedure topology sorting method
  • Visualization graph procedure topology sorting method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] The technical solutions of the present invention will be described in detail below in conjunction with the accompanying drawings.

[0025] Such as figure 2 As shown, the present invention provides a visual graph program topology sorting method, including the following four parts:

[0026] The first part, the preliminary sorting process based on position, imports and reads the visualization page file, forms a symbol list, and records the vertex coordinates of symbols, including input blocks, constant blocks, output blocks and function blocks, where the input block and constant block are 0 inputs 1 The output graphic symbol, which has met the condition of known state in the sorting, can be popped out of the stack first.

[0027] The coordinate starting point of the visualization page is set to the upper left corner, the x coordinates increase from left to right, and the y coordinates increase from top to bottom. According to the insertion sort algorithm, the symbols are...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a visualization graph procedure topology sorting method. The visualization graph procedure topology sorting method includes: sorting symbols in ascending order according to transverse x coordinates firstly and sorting symbols which has the same x coordinates in ascending order according to vertical y coordinates so as to form a preliminary sequence; designing a destruction symbol in a loop-locked graph network, and setting an input point of a succeeding symbol, which is connected with an output point of a loop-locked symbol, to be known; performing topology sorting according to depth-first and a data flow dependency relationship, and defining a topology sorting push rule; and preferentially judging whether status of a succeeding symbol which follows the symbol is known according to the data flow dependency relationship of the input and the output points, and sorting symbols with the data flow dependency relationship according to branch ergodic. The visualization graph procedure topology sorting method can reduce manual intervention processes, solve closed loop deadlock dependence, form an execution branch according to the data flow dependency relationship, and improve procedure operating efficiency.

Description

technical field [0001] The invention relates to topological sorting of graphical programs in the field of visual programming. Background technique [0002] First introduce several basic concepts in topological sorting, which can be combined at the same time Figure 1a and Figure 1b Shown: [0003] Topological sorting: Obtaining a total order on a set from a partial order on a certain set, this operation is called topological sorting. In code generation, it means to determine the calling sequence of symbols according to the connection relationship of symbols. [0004] Partial order: If a relation R on a set X is reflexive, antisymmetric, and transitive, then R is said to be a partial order relation on a set X. [0005] Total order: Let R be the partial order on the set X, if for each x, y∈X there must be xR y or yRx, then R is said to be a total order on the set X. [0006] Intuitively, a partial order means that only some members of the set are comparable, while a total...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
Inventor 冯亚东陈宏君刘克金曹冬明王国栋周强邱大为
Owner NR ELECTRIC CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products