Visualization graph procedure topology sorting method

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...

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

Images