And-or graph layering displaying method

Abstract

The invention discloses an and-or graph layering displaying method. The method includes the steps that (1) a start point and a final point of an and-or graph are created; (2) a data file is read, all model nodes and directed line segments in the and-or graph are built according to a tetrad data file, and an internal model of the and-or graph is formed; (3) initializing is conducted, a search mark of a node data object is set to be in an unsearched state; (4) the and-or graph model is searched in a width priority mode and displayed, starting from the start point or a root node, all and-or graph nodes are searched outwards and displayed layer by layer; (5) expansion processing is conducted, expansion processing is conducted on a static relation graph to enable the static relation graph to display all the nodes of the and-or graph dynamically. By means of the and-or graph layering displaying method, a tree window frequently-used in a computer system can be used to display the complex and-or graph with multiple schemes, representation of the complex and-or graph is made to be more concise and clearer by adding virtual nodes, cross of lines is avoided, and the method is especially suitable for large-scale complex problem or scheme representation and optimization solving.

Description

technical field [0001] The invention belongs to the technical field of computer graphics, and more specifically relates to a hierarchical display method of an AND-OR graph, which is used to display a two-dimensional AND-OR graph using tree-like display software commonly used in computer systems. Background technique [0002] For complex engineering problems, the problem is often decomposed into some independent small problems, and then they are solved separately. The AND-OR graph is a powerful tool to describe this engineering solution method, which is characterized by linking problems with parent-child relationships and decomposing sub-problems. Formally, all problems and sub-problems form a hierarchical structure, similar to a directed acyclic graph. Different from the directed acyclic graph, the AND-OR graph also includes an AND-OR relationship, because the decomposition of the problem does not have only one solution, and the AND-OR graph can simultaneously express multi...

AI Technical Summary

Problems solved by technology

[0010] 2) Graphical layout is difficult

Although manual drawing can provide a relatively perfect effect, the drawing efficiency is very low, and the crossing lines cannot be completely eliminated

[0012] 3) It is inconvenient to automatically draw the AND or relationship

This method is very refined and easy to understand, but it is not easy to realize automatic drawing in the computer system, because the connection between the parent-child relationship in the computer is usually a broken line, and it is not easy to distinguish between several broken lines. relation

[0014] 4) poor overall sense

[0015] When the number of directed graph nodes and directed line segments is relatively large, the size of the entire AND-OR graph will become very large, and the computer display screen is limited, which brings difficulties to use

If you look at the whole picture, you may not be able to see the text information on the picture clearly; if you look at a partial picture, it is difficult to form an overall impression

[0016] 5) It is troublesome to find

[0017] Similarly, when the number of nodes in the AND or graph is large, although the text can be zoomed in to see clearly, but at the same time the visible part is very small, it will be difficult to find nodes or directed line segments that are not within the current view range

When zooming out the content of the drawing, although you can quickly move the and or drawing, you must zoom in to confirm the content you need to find

[0018] 6) Graphic maintenance is difficult

[0020] In particular, it should be pointed out that no matter whether computer graphics are used or not, when recursion appears in the AND-OR graph, using the traditional method to draw the AND-OR graph may increase a lot of work because the recursive relationship cannot be fully utilized

E.g, figure 1 There are only 4 assemblies shown, and only 2 parts participate in each assembly, which will generate 12 nodes and 29 edges. If the number of parts that make up the product is relatively large, the number of parts participating in each assembly is not limited , the number of nodes and edges will be very large, so it will be difficult to guarantee the correctness when drawing the AND or graph

Images