CN110544045A - production flow chart drawing method and device - Google Patents
production flow chart drawing method and device Download PDFInfo
- Publication number
- CN110544045A CN110544045A CN201910852982.XA CN201910852982A CN110544045A CN 110544045 A CN110544045 A CN 110544045A CN 201910852982 A CN201910852982 A CN 201910852982A CN 110544045 A CN110544045 A CN 110544045A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- target
- downstream
- data structure
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000004519 manufacturing process Methods 0.000 title claims abstract description 80
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000004364 calculation method Methods 0.000 claims description 8
- 238000010586 diagram Methods 0.000 description 4
- 230000001360 synchronised effect Effects 0.000 description 3
- 238000009877 rendering Methods 0.000 description 2
- 238000000926 separation method Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004140 cleaning Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000010438 heat treatment Methods 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000004321 preservation Methods 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
- 238000011144 upstream manufacturing Methods 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0633—Workflow analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/04—Manufacturing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Health & Medical Sciences (AREA)
- Development Economics (AREA)
- Educational Administration (AREA)
- Manufacturing & Machinery (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
the application provides a production flow chart drawing method and a device, wherein the method comprises the following steps: analyzing a data structure and obtaining an initial node, wherein the initial node is used as a first node; traversing a downstream node of the first node in the data structure, taking the traversed downstream node as a target node, acquiring the type of the target node from the data structure, and calculating the weight of the target node according to the type of the target node; taking the target node as a first node, and executing the step of traversing the downstream nodes of the first node in the data structure until all the nodes in the data structure are traversed; determining the geometric position of each node according to the calculated weight of each node; and drawing a production flow chart according to the downstream relation among the nodes in the data structure and the geometric positions of all the nodes. In the present application, the production flow chart can be drawn in the above manner.
Description
Technical Field
The present disclosure relates to the field of flow chart design technologies, and in particular, to a method and an apparatus for drawing a production flow chart.
background
in the production process, production is generally guided according to a set production flow (for example, the sequence of execution of the specified tasks is that ' inspection before production ', water adding ', ' heating ', ' heat preservation ' and ' cleaning after production ') is performed. The production flow is typically stored in a database in the form of a data structure that can be processed by a computer.
In the production process, there is often a need to draw a production flowchart based on the production flow stored in the database, but how to draw the production flowchart becomes a problem.
disclosure of Invention
in order to solve the above technical problem, an embodiment of the present application provides a method and an apparatus for drawing a production flow chart, so as to achieve the purpose of drawing the production flow chart, and the technical scheme is as follows:
a production flow diagram drawing method comprising:
Analyzing a data structure and obtaining an initial node, wherein the initial node is used as a first node, the initial node is used for describing the start of a production process, and the downstream relationship among nodes in the data structure is the relationship which is consistent with a production sequence;
traversing a downstream node of the first node in the data structure, taking the traversed downstream node as a target node, acquiring the type of the target node from the data structure, and calculating the weight of the target node according to the type of the target node;
Taking the target node as a first node, and returning to the step of traversing the downstream nodes of the first node in the data structure until all the nodes in the data structure are traversed;
determining the geometric position of each node according to the calculated weight of each node;
And drawing a production flow chart according to the downstream relation among the nodes in the data structure and the geometric positions of all the nodes.
Preferably, the calculating the weight of the target node according to the type of the target node includes:
If the type of the target node is a parallel branch node or an alternative branch node, respectively taking each downstream node of the target node as an initial position, and traversing the nodes in the data structure downwards until the nodes matched with the target node are traversed; the parallel branch node is a node describing the start of a parallel processing task, and the alternative branch node is a node describing the need of selecting one branch to execute;
Respectively determining the number of branches between a node paired with the target node and each downstream node of the target node, and taking the sum of the number of branches as the weight of the target node;
if the type of the target node is a parallel synchronization node or an alternative merging node, taking the weight of a node paired with the target node as the weight of the target node, wherein the parallel synchronization node is a node paired with the parallel branch node, and the alternative merging node is a node paired with the alternative branch node;
and if the type of the target node is a non-parallel branch node or a non-alternative branch node, setting the weight of the target node to be 1.
Preferably, the traversing the nodes in the data structure downward with each downstream node of the target node as a start position until the nodes paired with the target node are traversed includes:
taking a first downstream node of the target node as an initial position, and traversing the nodes in the data structure downwards until the nodes matched with the target node are traversed, wherein the first downstream node is one downstream node of the target node;
and respectively traversing the nodes in the data structure downwards by taking other downstream nodes of the target node except the first downstream node as initial positions until the nodes matched with the target node are traversed.
preferably, the non-parallel branch node or the non-alternative branch node includes: a conditional node, a skip node, a task node or a termination node;
the condition node is a node which triggers the execution of the subsequent node when the configured condition is met;
the skip node is a node for indicating to skip to a specified node;
The task nodes are nodes describing production tasks;
the termination node is a node describing the end of the production process.
a production flow chart drawing apparatus comprising:
the system comprises a first determining module, a second determining module and a third determining module, wherein the first determining module is used for analyzing a data structure and obtaining an initial node, the initial node is used as a first node, the initial node is used for describing the start of a production process, and the downstream relationship among nodes in the data structure is the relationship which is consistent with a production sequence;
A calculation module, configured to traverse a downstream node of the first node in the data structure, use the traversed downstream node as a target node, obtain a type of the target node from the data structure, and calculate a weight of the target node according to the type of the target node;
a second determining module, configured to use the target node as a first node, and return to the step of executing traversal of a downstream node of the first node in the data structure until each node in the data structure is traversed;
The third determining module is used for determining the geometric position of each node according to the calculated weight of each node;
and the drawing module is used for drawing a production flow chart according to the downstream relation among the nodes in the data structure and the geometric positions of all the nodes.
preferably, the calculation module is specifically configured to:
if the type of the target node is a parallel branch node or an alternative branch node, respectively taking each downstream node of the target node as an initial position, and traversing the nodes in the data structure downwards until the nodes matched with the target node are traversed; the parallel branch node is a node describing the start of a parallel processing task, and the alternative branch node is a node describing the need of selecting one branch to execute;
respectively determining the number of branches between a node paired with the target node and each downstream node of the target node, and taking the sum of the number of branches as the weight of the target node;
if the type of the target node is a parallel synchronization node or an alternative merging node, taking the weight of a node paired with the target node as the weight of the target node, wherein the parallel synchronization node is a node paired with the parallel branch node, and the alternative merging node is a node paired with the alternative branch node;
and if the type of the target node is a non-parallel branch node or a non-alternative branch node, setting the weight of the target node to be 1.
Preferably, the calculation module is specifically configured to:
taking a first downstream node of the target node as an initial position, and traversing the nodes in the data structure downwards until the nodes matched with the target node are traversed, wherein the first downstream node is one downstream node of the target node;
And respectively traversing the nodes in the data structure downwards by taking other downstream nodes of the target node except the first downstream node as initial positions until the nodes matched with the target node are traversed.
preferably, the non-parallel branch node or the non-alternative branch node includes: a conditional node, a skip node, a task node or a termination node;
the condition node is a node which triggers the execution of the subsequent node when the configured condition is met;
The skip node is a node for indicating to skip to a specified node;
The task nodes are nodes describing production tasks;
the termination node is a node describing the end of the production process.
compared with the prior art, the beneficial effect of this application is:
In the application, since the starting node is a node describing the beginning of the production process, the data structure is firstly analyzed and the starting node is obtained, and the starting node is used as a first node, so that the reliability of the traversed starting position is ensured. And traversing downstream nodes of a first node in a data structure, taking the traversed downstream nodes as target nodes, obtaining the types of the target nodes from the data structure, calculating the weights of the target nodes according to the types of the target nodes, taking the target nodes as the first nodes, returning to the step of traversing the downstream nodes of the first nodes in the data structure until all the nodes in the data structure are traversed, obtaining the weights of all the nodes, determining the geometric positions of all the nodes on the basis of obtaining the weights of all the nodes, and drawing a production flow chart according to the downstream relationship among the nodes in the data structure and the geometric positions of all the nodes, thereby realizing the drawing of the production flow chart.
drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive labor.
FIG. 1 is a flow chart of a method of production flow chart rendering provided herein;
FIG. 2 is a flowchart of calculating a weight of a target node according to the present application;
FIG. 3 is a schematic view of a process flow provided by the present application;
fig. 4 is a schematic diagram of a logical structure of a production flow chart drawing apparatus provided in the present application.
Detailed Description
the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
the embodiment of the application discloses a production flow chart drawing method, which comprises the following steps: analyzing a data structure and obtaining an initial node, wherein the initial node is used as a first node, the initial node is used for describing the start of a production process, and the downstream relationship among nodes in the data structure is the relationship which is consistent with a production sequence; traversing a downstream node of the first node in the data structure, taking the traversed downstream node as a target node, acquiring the type of the target node from the data structure, and calculating the weight of the target node according to the type of the target node; taking the target node as a first node, and returning to the step of traversing the downstream nodes of the first node in the data structure until all the nodes in the data structure are traversed; determining the geometric position of each node according to the calculated weight of each node; and drawing a production flow chart according to the downstream relation among the nodes in the data structure and the geometric positions of all the nodes. In the application, the drawing of the production flow chart is realized.
next, a production flowchart drawing method disclosed in an embodiment of the present application is introduced, and as shown in fig. 1, a flowchart of an embodiment 1 of the production flowchart drawing method provided in the present application is provided, where the method includes the following steps:
and step S11, analyzing the data structure and obtaining a starting node, wherein the starting node is used as a first node.
It is understood that the data structure is a data form stored in the computer by the production process, and the data structure records information of each node in the production process, such as the type of the node, the downstream relationship of the node, and the meaning of the node.
the starting node is a node describing the beginning of the production process, and the downstream relationship among the nodes in the data structure is a relationship conforming to the production sequence.
The downstream relation among the nodes in the data structure is the relation conforming to the production sequence, and the nodes can be ensured to be traversed according to the production sequence.
step S12, traversing the downstream node of the first node in the data structure, taking the traversed downstream node as a target node, obtaining the type of the target node from the data structure, and calculating the weight of the target node according to the type of the target node.
in this embodiment, the downstream node of the first node in the data structure may be traversed by the downstream relationship of the first node recorded in the data structure.
It can be understood that the type of the node can represent the meaning of the node in the production flow, the types of the node are different, and the weight of the node may be different, so that the type of the target node can be obtained from the data structure, and the weight of the target node is calculated according to the type of the target node.
step S13, taking the target node as a first node, and executing the step of traversing the downstream node of the first node in the data structure until each node in the data structure is traversed.
and taking the target node as a first node, returning to the step of executing traversal of the downstream node of the first node in the data structure until all nodes in the data structure are traversed, ensuring that all nodes in the data structure are traversed, and calculating the weight of all nodes.
and step S14, determining the geometric position of each node according to the calculated weight of each node.
the geometric position of each node can be determined by using a relational expression consisting of the coordinates of the starting node, the sizes of other nodes, the weight of the node and the spatial interval between the nodes.
and step S15, drawing a production flow chart according to the downstream relation among the nodes in the data structure and the geometric positions of the nodes.
based on the downstream relationship between nodes in the data structure and the determination of the geometric position of each node, a production flow diagram can be drawn.
In the application, since the starting node is a node describing the beginning of the production process, the data structure is firstly analyzed and the starting node is obtained, and the starting node is used as a first node, so that the reliability of the traversed starting position is ensured. And traversing downstream nodes of a first node in a data structure, taking the traversed downstream nodes as target nodes, acquiring the types of the target nodes from the data structure, calculating the weights of the target nodes according to the types of the target nodes, taking the target nodes as the first nodes, executing the step of traversing the downstream nodes of the first nodes in the data structure until all the nodes in the data structure are traversed, acquiring the weights of all the nodes, determining the geometric positions of all the nodes on the basis of the acquired weights of all the nodes, and drawing a production flow chart according to the downstream relationship among the nodes in the data structure and the geometric positions of all the nodes, thereby realizing the drawing of the production flow chart.
in another embodiment of the present application, a process of calculating a weight of the target node according to the type of the target node in embodiment 1 is described, please refer to fig. 2, which may include the following steps:
and step S21, if the type of the target node is a parallel branch node or an alternative branch node, respectively taking each downstream node of the target node as an initial position, and traversing the nodes in the data structure downwards until the nodes matched with the target node are traversed.
the parallel branch node is a node describing the start of a parallel processing task, and the alternative branch node is a node describing that one branch needs to be selected for execution.
The node paired with the target node may be understood as: a node that appears paired with the target node. And the weight of the node paired with the target node is the same as that of the target node.
In this embodiment, a depth-first traversal algorithm and a breadth-first traversal algorithm may be used to traverse the nodes in the data structure downward with each downstream node of the target node as an initial position until a node paired with the target node is traversed.
specifically, the process of traversing the nodes in the data structure downward with each downstream node of the target node as a start position until traversing to a node paired with the target node may include:
And A11, taking a first downstream node of the target node as a starting position, and traversing the nodes in the data structure downwards until a node paired with the target node is traversed, wherein the first downstream node is one of the downstream nodes of the target node.
In the step, a depth-first traversal algorithm is utilized for traversal.
And A12, respectively traversing the nodes in the data structure downwards by taking each other downstream node of the target node except the first downstream node as a starting position until the nodes matched with the target node are traversed.
determining other downstream nodes of the target node except the first downstream node by using a breadth-first traversal algorithm, and traversing the nodes in the data structure downwards by using the depth-first traversal algorithm and taking the other downstream nodes of the target node except the first downstream node as initial positions.
step S22, determining the number of branches between the node paired with the target node and each downstream node of the target node, determining the weight of the downstream node in each branch number, selecting the maximum weight from the weights of the downstream nodes in each branch number, and taking the sum of the maximum weights and 1 as the weight of the target node.
step S23, if the type of the target node is a parallel synchronization node or a merge node, taking the weight of the node paired with the target node as the weight of the target node.
The parallel synchronization node is a node which appears in pair with the parallel branch node, and the alternative merging node is a node which appears in pair with the alternative branch node.
because the weight of the node paired with the target node is the same as that of the target node, after the weight of the parallel branch node or the alternative branch node is determined, the weight of the parallel branch node can be directly used as the weight of the parallel synchronous node or the weight of the alternative branch node can be used as the weight of the alternative merging node.
step S24, if the type of the target node is a non-parallel branch node or a non-alternative branch node, setting the weight of the target node to 1.
Since the branch number of the non-parallel branch node or the non-alternative branch node is 1, the weight of the target node may be set to 1.
In this embodiment, the non-parallel branch node or the non-alternative branch node may include, but is not limited to: an initiating node, a conditional node, a skip node, a task node, or a terminating node.
the condition node is a node which triggers the execution of the subsequent node when the configured condition is met;
the skip node is a node for indicating to skip to a specified node;
the task nodes are nodes describing production tasks;
the termination node is a node describing the end of the production process.
taking a specific production flow chart as an example, steps S21-S24 are introduced, as shown in fig. 3, where a long single horizontal line indicates an alternative branch node or an alternative merge node, a short double horizontal line indicates a condition node, a long double horizontal line indicates a parallel branch node or a parallel synchronization node, tasks 1, 2, and … 11 indicate task nodes, a downstream node of an initial node is task 1, a weight of task 1 is 1, a downstream node of task 1 is an alternative branch node 1, an alternative branch node 1 has two downstream nodes, respectively conditional nodes 1 and 2, the conditional node 1 is taken as an initial position, the nodes are traversed downward until the alternative merge node 1 is traversed, and the number of branches between the conditional node 1 and the alternative merge node 1 is determined to be 2, then the conditional node 2 is taken as an initial position, the nodes are traversed downward until the alternative merge node 1 is traversed, and the number of branches between the conditional node 2 and the alternative merge node 1 is determined to be 1, it can be determined that the weight of one branch node 1 is 3 and the weight of one merge node 1 is 3. Similarly, it may be determined that the weight of the parallel branch node 1 is 2, the weight of the parallel branch node 2 is 3, the weight of the parallel synchronization node 2 is 3, and the weights of the alternative branch node 2 and the alternative merge node 2 are both 2.
The node now includes: taking parallel branch nodes, alternative branch nodes, non-parallel branch nodes, and non-alternative branch nodes as examples, the determination of the geometric position of each node according to the calculated weight of each node is explained, for example:
the geometric position of each node can be determined by using a position calculation formula of the node according to the calculated weight of each node. The position calculation formula of the node is as follows:
p＝(x,y,w,h)
wherein:
p0 is the starting node position and size;
pi is the position and size of the ith node;
x0 is a constant representing the origin node abscissa;
y0 is a constant representing the starting node ordinate;
w is a constant representing the node width;
h is a constant representing the node height;
a is a constant representing the longitudinal spatial separation;
b is a constant representing the lateral spatial separation;
Wi is the weight of the ith node.
Let us consider a parallel branch node and its matching parallel synchronization node and all nodes in between as a node, and a branch node and its matching merge node and all nodes in between as a node. At this time, the flow chart has only one column, all nodes are on the same column, the abscissa of all nodes is the same, and the weight is 1, that is, the abscissa of the node position is the abscissa of the column where the node is located is the upstream node ordinate + the longitudinal space interval. Each branch (parallel branch or alternative branch) may be treated as a sub-flow diagram.
The algorithm corresponding to the process of calculating the weight of each node described in the foregoing embodiments may be referred to as follows:
Wherein, N represents the node of the production flow chart, Nj represents the synchronous node corresponding to the parallel branch or the merging node corresponding to an alternative branch, W represents the weight of the node, G represents the whole production flow chart, Level represents the branch number, SubLevel represents the branch number of the node, SubNj represents the parallel synchronous node or an alternative merging node, SubNode represents the downstream node of a certain node, N
Representing all of the downstream nodes of a certain node,
next, a production flow chart drawing apparatus provided in the present application will be described, and the production flow chart drawing apparatus described below and the production flow chart drawing method described above may be referred to in correspondence with each other.
referring to fig. 4, the apparatus for drawing a production flow chart includes: a first determination module 11, a calculation module 12, a second determination module 13, a third determination module 14 and a rendering module 15.
A first determining module 11, configured to analyze a data structure and obtain an initial node, where the initial node is used as a first node, the initial node is a node describing a start of a production process, and a downstream relationship between nodes in the data structure is a relationship that matches a production sequence;
a calculating module 12, configured to traverse a downstream node of the first node in the data structure, use the traversed downstream node as a target node, obtain a type of the target node from the data structure, and calculate a weight of the target node according to the type of the target node;
A second determining module 13, configured to use the target node as a first node, and return to the step of traversing downstream nodes of the first node in the data structure until each node in the data structure is traversed;
A third determining module 14, configured to determine a geometric position of each node according to the calculated weight of each node;
And the drawing module 15 is configured to draw a production flow chart according to the downstream relationship between the nodes in the data structure and the geometric positions of the nodes.
In this embodiment, the calculating module 12 may be specifically configured to:
If the type of the target node is a parallel branch node or an alternative branch node, respectively taking each downstream node of the target node as an initial position, and traversing the nodes in the data structure downwards until the nodes matched with the target node are traversed; the parallel branch node is a node describing the start of a parallel processing task, and the alternative branch node is a node describing the need of selecting one branch to execute;
Respectively determining the number of branches between a node paired with the target node and each downstream node of the target node, determining the weight of the downstream node in each branch number, respectively selecting the maximum weight from the weights of the downstream nodes in each branch number, and taking the sum of the maximum weights and 1 as the weight of the target node;
If the type of the target node is a parallel synchronization node or an alternative merging node, taking the weight of a node paired with the target node as the weight of the target node, wherein the parallel synchronization node is a node paired with the parallel branch node, and the alternative merging node is a node paired with the alternative branch node;
and if the type of the target node is a non-parallel branch node or a non-alternative branch node, setting the weight of the target node to be 1.
in this embodiment, the calculation module 12 may be specifically configured to:
Taking a first downstream node of the target node as an initial position, and traversing the nodes in the data structure downwards until the nodes matched with the target node are traversed, wherein the first downstream node is one downstream node of the target node;
and respectively traversing the nodes in the data structure downwards by taking other downstream nodes of the target node except the first downstream node as initial positions until the nodes matched with the target node are traversed.
In this embodiment, the non-parallel branch node or the non-alternative branch node includes: an initial node, a conditional node, a skip node, a task node or a termination node;
The condition node is a node which triggers the execution of the subsequent node when the configured condition is met;
the skip node is a node for indicating to skip to a specified node;
the task nodes are nodes describing production tasks;
The termination node is a node describing the end of the production process.
It should be noted that each embodiment is mainly described as a difference from the other embodiments, and the same and similar parts between the embodiments may be referred to each other. For the device-like embodiment, since it is basically similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
for convenience of description, the above devices are described as being divided into various units by function, and are described separately. Of course, the functionality of the units may be implemented in one or more software and/or hardware when implementing the present application.
From the above description of the embodiments, it is clear to those skilled in the art that the present application can be implemented by software plus necessary general hardware platform. Based on such understanding, the technical solutions of the present application may be essentially or partially implemented in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., and includes several instructions for enabling a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method according to the embodiments or some parts of the embodiments of the present application.
The above detailed description is provided for a retrieval method, apparatus and system provided by the present application, and the principle and implementation of the present application are explained by applying specific examples, and the description of the above embodiments is only used to help understanding the method and core ideas of the present application; meanwhile, for a person skilled in the art, according to the idea of the present application, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present application.
Claims (8)
1. a method for drawing a production flow chart, comprising:
Analyzing a data structure and obtaining an initial node, wherein the initial node is used as a first node, the initial node is used for describing the start of a production process, and the downstream relationship among nodes in the data structure is the relationship which is consistent with a production sequence;
Traversing a downstream node of the first node in the data structure, taking the traversed downstream node as a target node, acquiring the type of the target node from the data structure, and calculating the weight of the target node according to the type of the target node;
taking the target node as a first node, and executing a step of traversing downstream nodes of the first node in the data structure until all nodes in the data structure are traversed;
Determining the geometric position of each node according to the calculated weight of each node;
and drawing a production flow chart according to the downstream relation among the nodes in the data structure and the geometric positions of all the nodes.
2. the method according to claim 1, wherein the calculating the weight of the target node according to the type of the target node comprises:
if the type of the target node is a parallel branch node or an alternative branch node, respectively taking each downstream node of the target node as an initial position, and traversing the nodes in the data structure downwards until the nodes matched with the target node are traversed; the parallel branch node is a node describing the start of a parallel processing task, and the alternative branch node is a node describing the need of selecting one branch to execute;
respectively determining the number of branches between a node paired with the target node and each downstream node of the target node, determining the weight of the downstream node in each branch number, respectively selecting the maximum weight from the weights of the downstream nodes in each branch number, and taking the sum of the maximum weights and 1 as the weight of the target node;
If the type of the target node is a parallel synchronization node or an alternative merging node, taking the weight of a node paired with the target node as the weight of the target node, wherein the parallel synchronization node is a node paired with the parallel branch node, and the alternative merging node is a node paired with the alternative branch node;
and if the type of the target node is a non-parallel branch node or a non-alternative branch node, setting the weight of the target node to be 1.
3. The method of claim 2, wherein traversing the nodes in the data structure downward with each downstream node of the target node as a starting position until traversing to a node paired with the target node comprises:
Taking a first downstream node of the target node as an initial position, and traversing the nodes in the data structure downwards until the nodes matched with the target node are traversed, wherein the first downstream node is one downstream node of the target node;
And respectively traversing the nodes in the data structure downwards by taking other downstream nodes of the target node except the first downstream node as initial positions until the nodes matched with the target node are traversed.
4. the method of claim 2, wherein the non-parallel branch node or non-alternative branch node comprises: the starting node, the condition node, the skip node, the task node or the termination node;
the condition node is a node which triggers the execution of the subsequent node when the configured condition is met;
The skip node is a node for indicating to skip to a specified node;
The task nodes are nodes describing production tasks;
The termination node is a node describing the end of the production process.
5. A production flow chart drawing apparatus, comprising:
The system comprises a first determining module, a second determining module and a third determining module, wherein the first determining module is used for analyzing a data structure and obtaining an initial node, the initial node is used as a first node, the initial node is used for describing the start of a production process, and the downstream relationship among nodes in the data structure is the relationship which is consistent with a production sequence;
A calculation module, configured to traverse a downstream node of the first node in the data structure, use the traversed downstream node as a target node, obtain a type of the target node from the data structure, and calculate a weight of the target node according to the type of the target node;
a second determining module, configured to use the target node as a first node, and return to the step of executing traversal of a downstream node of the first node in the data structure until each node in the data structure is traversed;
The third determining module is used for determining the geometric position of each node according to the calculated weight of each node;
and the drawing module is used for drawing a production flow chart according to the downstream relation among the nodes in the data structure and the geometric positions of all the nodes.
6. the apparatus of claim 5, wherein the computing module is specifically configured to:
if the type of the target node is a parallel branch node or an alternative branch node, respectively taking each downstream node of the target node as an initial position, and traversing the nodes in the data structure downwards until the nodes matched with the target node are traversed; the parallel branch node is a node describing the start of a parallel processing task, and the alternative branch node is a node describing the need of selecting one branch to execute;
Respectively determining the number of branches between a node paired with the target node and each downstream node of the target node, determining the weight of the downstream node in each branch number, respectively selecting the maximum weight from the weights of the downstream nodes in each branch number, and taking the sum of the maximum weights and 1 as the weight of the target node;
if the type of the target node is a parallel synchronization node or an alternative merging node, taking the weight of a node paired with the target node as the weight of the target node, wherein the parallel synchronization node is a node paired with the parallel branch node, and the alternative merging node is a node paired with the alternative branch node;
and if the type of the target node is a non-parallel branch node or a non-alternative branch node, setting the weight of the target node to be 1.
7. the apparatus of claim 6, wherein the computing module is specifically configured to:
Taking a first downstream node of the target node as an initial position, and traversing the nodes in the data structure downwards until the nodes matched with the target node are traversed, wherein the first downstream node is one downstream node of the target node;
and respectively traversing the nodes in the data structure downwards by taking other downstream nodes of the target node except the first downstream node as initial positions until the nodes matched with the target node are traversed.
8. the apparatus of claim 6, wherein the non-parallel branch node or non-alternative branch node comprises: the starting node, the condition node, the skip node, the task node or the termination node;
The condition node is a node which triggers the execution of the subsequent node when the configured condition is met;
the skip node is a node for indicating to skip to a specified node;
The task nodes are nodes describing production tasks;
the termination node is a node describing the end of the production process.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910852982.XA CN110544045B (en) | 2019-09-10 | 2019-09-10 | Production flow chart drawing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910852982.XA CN110544045B (en) | 2019-09-10 | 2019-09-10 | Production flow chart drawing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110544045A true CN110544045A (en) | 2019-12-06 |
| CN110544045B CN110544045B (en) | 2022-04-22 |
Family
ID=68713272
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910852982.XA Active CN110544045B (en) | 2019-09-10 | 2019-09-10 | Production flow chart drawing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110544045B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2011048477A (en) * | 2009-08-25 | 2011-03-10 | Justsystems Corp | Device, method, and program for drawing flow chart |
| CN103473388A (en) * | 2013-07-25 | 2013-12-25 | 深圳市华傲数据技术有限公司 | System and device capable of realizing automatic layout of flow chart |
| CN103577164A (en) * | 2012-07-20 | 2014-02-12 | 腾讯科技（深圳）有限公司 | Flow diagram generating method and device |
| CN106508009B (en) * | 2010-12-31 | 2014-07-02 | 上海机电工程研究所 | A kind of processor-oriented high-level language source program flow process map generalization method |
| CN105138859A (en) * | 2015-09-30 | 2015-12-09 | 四川师范大学 | Three-dimensional panorama roaming path finding method and system |
| CN106648608A (en) * | 2016-10-21 | 2017-05-10 | 吴晓军 | Flexible and convenient flow chart building method |
-
2019
- 2019-09-10 CN CN201910852982.XA patent/CN110544045B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2011048477A (en) * | 2009-08-25 | 2011-03-10 | Justsystems Corp | Device, method, and program for drawing flow chart |
| CN106508009B (en) * | 2010-12-31 | 2014-07-02 | 上海机电工程研究所 | A kind of processor-oriented high-level language source program flow process map generalization method |
| CN103577164A (en) * | 2012-07-20 | 2014-02-12 | 腾讯科技（深圳）有限公司 | Flow diagram generating method and device |
| CN103473388A (en) * | 2013-07-25 | 2013-12-25 | 深圳市华傲数据技术有限公司 | System and device capable of realizing automatic layout of flow chart |
| CN105138859A (en) * | 2015-09-30 | 2015-12-09 | 四川师范大学 | Three-dimensional panorama roaming path finding method and system |
| CN106648608A (en) * | 2016-10-21 | 2017-05-10 | 吴晓军 | Flexible and convenient flow chart building method |
Non-Patent Citations (2)
| Title |
|---|
| WENWU LI 等: ""Distribution network state estimation based on node voltage of variable weights"", 《2013 5TH INTERNATIONAL CONFERENCE ON MODELLING, IDENTIFICATION AND CONTROL (ICMIC)》 * |
| 袁正刚: ""工程CAD中拓扑建模与工程对象几何模型的研究"", 《中国博士学位论文全文数据库信息科技辑》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110544045B (en) | 2022-04-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10402427B2 (en) | System and method for analyzing result of clustering massive data | |
| CN111309539A (en) | Abnormity monitoring method and device and electronic equipment | |
| CN111243601B (en) | Voiceprint clustering method and device, electronic equipment and computer-readable storage medium | |
| US9882949B1 (en) | Dynamic detection of data correlations based on realtime data | |
| CN113420652B (en) | Time sequence signal segment abnormality identification method, system, medium and terminal | |
| CN109189840B (en) | Streaming online log analysis method | |
| CN113360350A (en) | Method, device, equipment and storage medium for positioning root cause alarm of network equipment | |
| CN110544045B (en) | Production flow chart drawing method and device | |
| CN108509545B (en) | Method and system for processing comments of article | |
| CN113297416A (en) | Video data storage method and device, electronic equipment and readable storage medium | |
| CN107016028B (en) | Data processing method and apparatus thereof | |
| CN111625468A (en) | Test case duplicate removal method and device | |
| CN113821630A (en) | Data clustering method and device | |
| CN108664550B (en) | Funnel analysis method and device for user behavior data | |
| JP5756052B2 (en) | User attribute estimation apparatus, method and program | |
| CN115358397A (en) | Parallel graph rule mining method and device based on data sampling | |
| CN111553187B (en) | Method and system for identifying form in CAD drawing | |
| CN109190003B (en) | Method and apparatus for determining list page nodes | |
| CN105761119A (en) | On-line number of people distribution calculation method and device | |
| CN106547907B (en) | Frequent item set acquisition method and device | |
| CN113935387A (en) | Text similarity determination method and device and computer readable storage medium | |
| CN113742564A (en) | Target resource pushing method and device | |
| CN106599002B (en) | Topic evolution analysis method and device | |
| WO2015045091A1 (en) | Method and program for extraction of super-structure in structural learning of bayesian network | |
| US20120278352A1 (en) | Computerized data set search method and apparatus |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |