Method for dynamically generating supply chain link diagram based on contract list

Abstract

A method for dynamically generating a supply chain link diagram based on a contract list relates to the technical field of supply chain link diagram generation, and comprises the following steps: acquiring a contract list of a supply chain; extracting the contract data into company nodes and contract nodes; constructing a two-dimensional array of nodes according to an upstream and downstream relationship of a supply chain link; calculating the overall width and height of the supply chain link diagram by using the two-dimensional array of the nodes; drawing a node view, drawing connecting lines and arrows, and rendering and outputting a supply chain link diagram content view; embedding the content view of the supply chain link diagram into the root layout of the supply chain link diagram; according to the method, the supply chain link diagram can be dynamically drawn, rendered and output on the basis of the supply chain contract conveniently, efficiently, completely and accurately, and the visual expression of the supply chain link can be completed by monitoring the contract list of the supply chain and synchronously updating the content view of the supply chain link diagram according to the modification when the contract data in the contract list is modified.

Description

Technical Field

[0001] The present invention relates to the technical field of supply chain link graph generation, and in particular to a method for dynamically generating a supply chain link graph based on a contract list. Background Art

[0002] The supply chain link diagram can fully, accurately and efficiently display the flow relationship between upstream and downstream nodes based on the constraints of framework contracts, procurement contracts and sales contracts. In order to give full play to the advantages of data visualization in supply chain management, it is necessary to convert a series of contracts in the supply chain into a supply chain link diagram.

[0003] Among the existing solutions for generating supply chain link diagrams, the first is to display the supply chain link diagram in the form of a static image. In this solution, the image generation has a certain lag (it cannot be generated instantly and needs to be generated and uploaded outside the system) and will generate additional space overhead (storage images). After the contract changes, the link diagram image needs to be generated and uploaded again.

[0004] The second solution is to dynamically generate a graphical view based on a tree data structure or adjacency matrix data structure. In this solution, the original contract data needs to be refined into graphical nodes, and then further transformed to construct a data source with a tree data structure or adjacency matrix structure. The data source is then input into the existing graphics generation framework, and the framework draws and renders the output graphics. In this solution, the data processing process is complex, and the final graphics effect is difficult to accurately express the complete supply chain link. The graphical view generated by the tree structure data source can show the hierarchical relationship of the supply chain link and the connectivity relationship of each node, but cannot express the "many-to-many" relationship of nodes at each level. The graphical view generated by the adjacency matrix data source can express the "many-to-many" relationship of nodes at each level and the connectivity relationship between nodes, but it is difficult to express the hierarchical relationship of the supply chain link.

[0005] Both of the above-mentioned two existing solutions have the problem of being unable to conveniently, efficiently, completely and accurately complete the visualization of the supply chain link based on the supply chain contract. Summary of the invention

[0006] An embodiment of the present invention provides a method for dynamically generating a supply chain link diagram based on a contract list, which can conveniently, efficiently, completely and accurately dynamically draw, render and output a supply chain link diagram based on a supply chain contract, thereby completing the visual expression of the supply chain link.

[0007] A method for dynamically generating a supply chain link graph based on a contract list, comprising:

[0008] Obtain a list of contracts for the supply chain;

[0009] Differentiate the types of contracts on the above contract list, and store the same type of contracts into the same type of sub-contract lists respectively;

[0010] Extract nodes from the contracts in the above sub-contract list respectively, and refine the contract data into company nodes and contract nodes;

[0011] The downstream of the node is saved in the children attribute of the node, and a two-dimensional array of nodes is constructed according to the upstream and downstream relationship of the supply chain link;

[0012] Use the two-dimensional array of nodes to calculate the overall width and height of the supply chain link graph;

[0013] Draw node views, draw lines and arrows, and render and output supply chain link graph content views;

[0014] Embed the supply chain link graph content view into the root layout of the supply chain link graph;

[0015] Monitor the contract list of the supply chain. When the contract data in the contract list is modified, the supply chain link diagram content view is synchronously updated according to the modification.

[0016] Furthermore, contract types include framework contracts, purchase contracts, and sales contracts.

[0017] Furthermore, the overall width and height calculation process of the supply chain link graph includes:

[0018] Input a two-dimensional array of nodes and traverse all nodes;

[0019] Calculate the width and height of all nodes after they are converted to subviews based on the node position, the font size of the text in the node, and the padding distance in the node;

[0020] Based on the horizontal and vertical spacing between nodes and the height of the lines and arrows between nodes, the overall width and height of the supply chain link diagram are finally calculated.

[0021] Furthermore, it includes a contract storage area and a contract list generator, wherein the contract storage area is suitable for storing supply chain contracts, and the contract list generator is suitable for generating a supply chain contract list according to the supply chain contracts.

[0022] Furthermore, the process of the contract list generator generating the contract list of the supply chain is as follows:

[0023] Read the contract and identify the contract data;

[0024] Extract the information in the contracts separately and generate a contract list in a unified format.

[0025] Furthermore, the contract list process of monitoring the supply chain includes:

[0026] Monitor contracts in the contract storage area;

[0027] After a contract is renewed, identify the type of contract renewal;

[0028] According to the type of update, identify the contract content and extract the information in the contract;

[0029] The information is processed in a unified format and written into the supply chain contract list.

[0030] Furthermore, the types of contract updates include deleting a contract, adding a new contract, and modifying a contract.

[0031] The beneficial effects of the above technical solution provided by the embodiment of the present invention include at least:

[0032] 1. Compared with the traditional static image solution, the dynamic generation of the present invention is more immediate, avoiding the additional image generation cost and storage space cost. Even if the contract is changed later, it will not affect the accuracy of the supply chain link diagram.

[0033] 2. Compared with the existing dynamic graphics generation solutions, the present invention is closer to the business and simplifies the data conversion process. It is no longer necessary to convert into a tree data structure or adjacency matrix as the data source of the graphics generation framework. Only the contract list needs to be input to complete the drawing and rendering of the supply chain link diagram, which is more convenient and efficient.

[0034] 3. The present invention completely preserves the hierarchical relationship and flow relationship between nodes in the supply chain, and supports many-to-many relationships between nodes in different hierarchies.

[0035] Other features and advantages of the present invention will be described in the following description, and partly become apparent from the description, or understood by practicing the present invention. The purpose and other advantages of the present invention can be realized and obtained by the structures particularly pointed out in the written description, claims, and drawings.

[0036] The technical solution of the present invention is further described in detail below through the drawings and embodiments. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] The accompanying drawings are used to provide a further understanding of the present invention and constitute a part of the specification. Together with the embodiments of the present invention, they are used to explain the present invention and do not constitute a limitation of the present invention. In the accompanying drawings:

[0038] Figure 1 A flowchart of a method for dynamically generating a supply chain link diagram based on a contract list disclosed in an embodiment of the present invention;

[0039] Figure 2 A node class diagram disclosed in an embodiment of the present invention;

[0040] Figure 3 A flowchart of data processing disclosed in an embodiment of the present invention;

[0041] Figure 4 A schematic diagram of the supply chain link graph content view structure disclosed in an embodiment of the present invention;

[0042] Figure 5 The supply chain link diagram content view disclosed in the embodiment of the present invention Figure 1 Schematic diagram. DETAILED DESCRIPTION

[0043] The exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although the exemplary embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be limited by the embodiments set forth herein. On the contrary, these embodiments are provided to enable a more thorough understanding of the present disclosure and to fully convey the scope of the present disclosure to those skilled in the art.

[0044] Figure 1 A flow chart of a method for dynamically generating a supply chain link diagram based on a contract list disclosed in an embodiment of the present invention is shown, including:

[0045] Step 1: Get the contract list of the supply chain. After data processing, extract the contract data into company nodes and contract nodes. Save the downstream of the node in the children attribute of the node. According to the upstream and downstream relationship of the supply chain link, construct a two-dimensional array of nodes.

[0046] like Figure 2 As shown in the figure, the extracted company node and contract node include the following attributes:

[0047] +String text;

[0048] +NodeType type;

[0049] +List children;

[0050] +void addChild(FlowNode child);

[0051] +void removeChild(FlowNode child);

[0052] +List getChildren().

[0053] The steps of constructing a two-dimensional array of nodes in step 1 include:

[0054] Step 11, enter the contract list;

[0055] Step 12, distinguish the types of contracts on the above contract list, and store the contracts of the same type into sub-contract lists of the same type.

[0056] Step 13, extract nodes from the contracts in the above sub-contract list respectively, and refine the contract data into company nodes and contract nodes.

[0057] Step 14, save the downstream of the node in the children attribute of the node, and construct a two-dimensional array of the node according to the upstream and downstream relationship of the supply chain link.

[0058] Among them, contracts include framework contracts, procurement contracts, and sales contracts.

[0059] like Figure 3 As shown, in the data processing process (steps 12 to 14):

[0060] Step 12 includes identifying the contracts on the contract list, classifying the contracts into framework contracts, purchase contracts, and sales contracts, and storing them into the framework contract list, purchase contract list, and sales contract list respectively according to the contract type.

[0061] In step 13, the types of node extraction for the contract include:

[0062] 1. Extract the framework contract list nodes.

[0063] The steps include:

[0064] Enter the framework contract list and the procurement contract list;

[0065] Extract the framework contract nodes from the framework contract list;

[0066] Determine whether there is a framework contract. If so, extract the upstream company node. If not, extract the upstream company node from the procurement contract list.

[0067] 2. Extract the purchase contract list nodes.

[0068] Enter the purchase contract list;

[0069] Extract upstream company nodes from the procurement contract list;

[0070] Extract framework sub-contract / purchase contract nodes;

[0071] Extract midstream company nodes.

[0072] 3. Extract sales contract list nodes.

[0073] Enter sales contract;

[0074] Refining sales contract nodes;

[0075] Refine downstream company nodes.

[0076] After the extraction of 1 to 3 above, a two-dimensional array of nodes is constructed according to the hierarchical relationship of upstream company node-framework contract node-framework sub-contract / purchase contract node-midstream company node-sales contract node-downstream company node.

[0077] Compared with the existing dynamic graphics generation solutions, the present invention is closer to the business and simplifies the data conversion process. It is no longer necessary to convert into a tree data structure or adjacency matrix as the data source of the graphics generation framework. Only the contract list needs to be input to complete the drawing and rendering of the supply chain link diagram, which is more convenient and efficient.

[0078] At the same time, through the association relationship between each node, the hierarchical relationship and flow relationship between the nodes in the supply chain can be fully preserved, supporting many-to-many relationships between nodes at different levels.

[0079] Step 2: Input the two-dimensional array of nodes, traverse all nodes, calculate the width and height of all nodes after they are converted into subviews based on the node position, the font size of the text in the node, and the filling distance in the node. Finally, calculate the overall width and height of the supply chain chain diagram based on the horizontal and vertical spacing between nodes and the height of the connecting lines and arrows between nodes.

[0080] The overall width and height calculation process of the supply chain link graph includes:

[0081] Step 21, input the two-dimensional array of nodes;

[0082] Step 22: Clear the node view cache

[0083] Step 23, traverse all nodes;

[0084] Step 24, traverse the two-dimensional array to construct a new node view, and configure different appearance attributes according to the node type;

[0085] Step 25, adding the node view as a subview to the supply chain link graph content view;

[0086] Step 26, caching the node object and the node view object in the form of a key-value pair;

[0087] Step 27, calculate the width and height of the node view;

[0088] in:

[0089] Width = left padding distance + text width of Node.text + right padding distance;

[0090] Height = top padding distance + text height of Node.text + bottom padding distance;

[0091] Step 28, calculating the width and height of the entire supply chain link graph;

[0092] In the level traversal:

[0093] Width = maximum single layer width = Math.max (maximum single layer width, maximum node view width * number of child nodes in the current layer + horizontal spacing between nodes * (number of child nodes in the current layer - 1));

[0094] Height = height + maximum node view height + vertical spacing between nodes (height of connecting arrows);

[0095] After the level traversal:

[0096] Height = height - longitudinal spacing between nodes;

[0097] After the traversal is completed, the final width and height calculation is completed.

[0098] It should be noted that the width and height of the text are affected by the terminal system, font library, font size, brush properties, etc.

[0099] Step 3: Calculate and determine the position of the node view based on the calculated width and height data.

[0100] include:

[0101] Step 31, declare the Y-axis coordinate yOffset of the current layer = 0;

[0102] Step 32: declare the maximum node view height of the current layer maxChildHeight = 0;

[0103] Step 33, start the hierarchical traversal of the node two-dimensional array;

[0104] Step 34: Determine whether there is a node in the current layer. If there is no node, continue to traverse the next layer. If there is a node, calculate the sum of the widths of the nodes in the current layer.

[0105] Step 35, declare the average width of the current layer node itemWidth = 0;

[0106] Step 36, itemWidth = (the overall width of the supply chain link graph - the horizontal spacing between nodes * (the number of sub-nodes in the current layer - 1)) / the number of sub-nodes in the current layer;

[0107] Step 37: Enable intra-layer node traversal in the layer traversal;

[0108] Step 38, calculating the starting coordinates of the nodes in the layer;

[0109] x coordinate = itemWidth*node's layer subscript+inter-node horizontal spacing*node's layer subscript+(itemWidth-width of the node view of the current node) / 2;

[0110] yCoordinate = yOffset;

[0111] Step 39, calculate the maximum node height;

[0112] maxChildHeight = Math.max(maxChildHeight, current node height);

[0113] Step 310: After traversing the nodes in the current layer, update the Y-axis coordinate yOffset of the next layer;

[0114] yOffset = yOffset + maxChildHeight + vertical spacing between nodes;

[0115] Step 311, continue the level traversal until all levels are traversed and the x, y coordinate positions of all nodes are determined.

[0116] Step 4: Draw the node view, draw the lines and arrows, and render and output the supply chain link diagram content view.

[0117] Step 41, drawing on canvas according to the x and y coordinates of the node and the calculated width and height;

[0118] Step 42, traverse the node two-dimensional array, and retrieve the node view object through the "node-node view" key-value pair cache;

[0119] Step 43: Calculate the coordinates of the middle position at the bottom of the node view as the starting point of the connection line;

[0120] Step 44, traverse the Node.childern attribute of the node, and retrieve the node view object to be connected through the "node-node view" key-value pair cache;

[0121] Step 45, calculate the coordinates of the middle position of the top of the node view to be connected, and use the middle position x coordinate and (middle position y coordinate-arrow height) as the receiving point coordinates of the connection line;

[0122] Step 46, according to the coordinates of the sending point and the receiving point of the connection line, calculate the longitudinal middle coordinate centerY between the two points, construct the first middle left side with the horizontal coordinate of the sending point and centerY, construct the second middle coordinate with the horizontal coordinate of the receiving point and centerY, and draw the connection line of "sending point->first middle coordinate->second middle coordinate->receiving point";

[0123] Step 47: Draw a triangular arrow at the receiving point.

[0124] like Figures 4-5 FIG. 1 is a schematic diagram of a supply chain link graph content view structure disclosed in an embodiment of the present invention and a supply chain link graph content view Figure 1 Example structure.

[0125] Step 5, embed the supply chain link graph content view into the root layout of the supply chain link graph;

[0126] Step 5 also includes monitoring touch events of the device, and performing scaling and displacement operations on the content view according to the touch events.

[0127] include:

[0128] 1. Drag and drop

[0129] Monitor the touch event of single-point movement and calculate the moving distance;

[0130] Moving distance = x, y coordinates of the moving point - x, y coordinates of the pressed point;

[0131] The coordinate position of the content view of the supply chain link graph is changed according to the moving distance.

[0132] 2. Scaling implementation

[0133] Listen to the touch event of double-point movement, calculate the distance d1 between the two points when pressed and the distance d2 between the two points after movement;

[0134] Scaling ratio = (d2 / d1)*scaling ratio*0.15+scaling ratio*0.85.

[0135] Update the zoom ratio of the supply chain link diagram content view.

[0136] Step 6: monitor the contract list of the supply chain. When the contract data in the contract list is modified, the supply chain link diagram content view is synchronously updated according to the modification.

[0137] It includes a contract storage area and a contract list generator, wherein the contract storage area is suitable for storing supply chain contracts, and the contract list generator is suitable for generating a supply chain contract list according to the supply chain contracts.

[0138] The process of the contract list generator generating the supply chain contract list is as follows:

[0139] Read the contract and identify the contract data;

[0140] Extract the information in the contracts separately and generate a contract list in a unified format.

[0141] Monitor contracts in the contract storage area;

[0142] After a contract is renewed, identify the type of contract renewal;

[0143] According to the type of update, identify the contract content and extract the information in the contract;

[0144] The information is processed in a unified format and written into the supply chain contract list.

[0145] The types of contract updates include deleting a contract, adding a new contract, and modifying a contract.

[0146] When the contract update type is to delete the contract, the supply chain link graph content view adopts the first update strategy, including the following steps:

[0147] Identify the deleted contract and mark the contract and the data generated by the contract;

[0148] Delete the data of the contract from the supply chain's contract list;

[0149] The company node and contract node extracted from the contract and the generated data are deleted by marking, and the content view of the supply chain link diagram is updated.

[0150] When the contract update type is a new contract, the supply chain link diagram content view adopts the second update strategy, including the following steps:

[0151] Identify the newly added contract and add the contract data to the supply chain contract list;

[0152] Regenerate the supply chain link diagram content view.

[0153] When the contract update type is to modify the contract, the supply chain link diagram content view adopts the third update strategy, including the following steps:

[0154] Identify the modified contract, modify the data of the contract from the contract list of the supply chain, and mark the contract and the data generated by the contract;

[0155] Identify the modified content, use tags to modify the company nodes and contract nodes extracted from the contract and the generated data, and update the content view of the supply chain link diagram.

[0156] Among the above three update strategies, the first and third update strategies adopt the direct deletion method, which has the advantage of reducing the calculation process and adjustment amount and improving the update speed. The second update strategy is to regenerate the content view of the supply chain link diagram, which is suitable for most cases and can also achieve synchronous update. The calculation and adjustment amount are relatively more than the first and third update strategies, which can be allocated and set according to actual needs.

[0157] The present invention proposes a method for dynamically generating a supply chain link diagram based on a contract list. The method can be dynamically generated in real time and can be updated synchronously when the contract is modified. At the same time, additional image generation overhead and storage space overhead are avoided. Compared with the existing dynamic graphics generation scheme, the present invention is closer to the business and simplifies the data conversion process. It is no longer necessary to convert it into a tree data structure or an adjacency matrix as a data source for the graphics generation framework. Only the contract list needs to be input to complete the drawing and rendering of the supply chain link diagram, which is more convenient and efficient. At the same time, the hierarchical relationship and flow relationship between the nodes in the supply chain are completely retained, and the many-to-many relationship between nodes between levels is supported to complete the visual expression of the supply chain link.

[0158] It should be understood that the specific order or hierarchy of steps in the disclosed process is an example of an exemplary method. Based on design preferences, it should be understood that the specific order or hierarchy of steps in the process can be rearranged without departing from the scope of protection of the present disclosure. The attached method claims present the elements of the various steps in an exemplary order and are not intended to be limited to the specific order or hierarchy described.

[0159] In the above detailed description, various features are grouped together in a single embodiment to simplify the disclosure. This method of disclosure should not be interpreted as reflecting an intention that the embodiments of the claimed subject matter require more features than are clearly stated in each claim. On the contrary, as reflected in the appended claims, the invention is in a state of having less than all the features of the disclosed individual embodiments. Therefore, the appended claims are hereby expressly incorporated into the detailed description, with each claim standing on its own as a separate preferred embodiment of the invention.

[0160] Those skilled in the art will also appreciate that the various illustrative logic blocks, modules, circuits, and algorithmic steps described in conjunction with the embodiments herein can all be implemented as electronic hardware, computer software, or a combination thereof. In order to clearly illustrate the interchangeability between hardware and software, various illustrative components, blocks, modules, circuits, and steps are generally described above around their functions. Whether such functions are implemented as hardware or software depends on specific applications and the design constraints imposed on the entire system. A skilled person can implement the described functions in an alternative manner for each specific application, but such implementation decisions should not be interpreted as departing from the scope of protection of the present disclosure.

[0161] The steps of the method or algorithm described in conjunction with the embodiments herein may be directly embodied as hardware, a software module executed by a processor, or a combination thereof. The software module may be located in a RAM memory, a flash memory, a ROM memory, an EPROM memory, an EEPROM memory, a register, a hard disk, a mobile disk, a CD-ROM, or any other form of storage medium well known in the art. An exemplary storage medium is connected to the processor so that the processor can read information from the storage medium and can write information to the storage medium. Of course, the storage medium may also be an integral part of the processor. The processor and the storage medium may be located in an ASIC. The ASIC may be located in a user terminal. Of course, the processor and the storage medium may also be present in a user terminal as discrete components.

[0162] For software implementation, the techniques described in this application can be implemented with modules (e.g., procedures, functions, etc.) that perform the functions described in this application. These software codes can be stored in a memory unit and executed by a processor. The memory unit can be implemented within the processor or outside the processor. In the latter case, it is coupled to the processor in a communication manner via various means, which are well known in the art.

[0163] The above description includes examples of one or more embodiments. Of course, it is impossible to describe all possible combinations of components or methods for the purpose of describing the above embodiments, but it should be recognized by those skilled in the art that the various embodiments may be further combined and arranged. Therefore, the embodiments described herein are intended to cover all such changes, modifications and variations that fall within the scope of protection of the appended claims. In addition, with respect to the term "comprising" used in the specification or claims, the word is covered in a manner similar to the term "including", just as "including," is explained as a transitional word in the claims. In addition, any term "or" used in the specification of the claims is intended to mean "non-exclusive or".

Claims

1. A method for dynamically generating a supply chain link diagram based on a contract list, characterized in that: include: Obtain a list of contracts for the supply chain; Differentiate the types of contracts on the above contract list, and store the same type of contracts into the same type of sub-contract lists respectively; Extract nodes from the contracts in the above sub-contract list respectively, and refine the contract data into company nodes and contract nodes; The downstream of the node is saved in the children attribute of the node, and a two-dimensional array of nodes is constructed according to the upstream and downstream relationship of the supply chain link; Use the two-dimensional array of nodes to calculate the overall width and height of the supply chain link graph; Draw node views, draw lines and arrows, and render and output supply chain link graph content views; Embed the supply chain link graph content view into the root layout of the supply chain link graph; Monitor the contract list of the supply chain. When the contract data in the contract list is modified, the supply chain link diagram content view is synchronously updated according to the modification.

2. The method according to claim 1, characterized in that Contract types include framework contracts, procurement contracts, and sales contracts.

3. The method according to claim 1, characterized in that The overall width and height calculation process of the supply chain link graph includes: Input a two-dimensional array of nodes and traverse all nodes; Calculate the width and height of all nodes after they are converted to subviews based on the node position, the font size of the text in the node, and the padding distance in the node; Based on the horizontal and vertical spacing between nodes and the height of the lines and arrows between nodes, the overall width and height of the supply chain link diagram are finally calculated.

4. The method according to claim 1, characterized in that It includes a contract storage area and a contract list generator, wherein the contract storage area is suitable for storing supply chain contracts, and the contract list generator is suitable for generating a supply chain contract list according to the supply chain contracts.

5. The method according to claim 4, characterized in that The process of the contract list generator generating the supply chain contract list is as follows: Read the contract and identify the contract data; Extract the information in the contracts separately and generate a contract list in a unified format.

6. The method according to claim 1, characterized in that The contract list process for monitoring the supply chain includes: Monitor contracts in the contract storage area; After a contract is renewed, identify the type of contract renewal; According to the type of update, identify the contract content and extract the information in the contract; The information is processed in a unified format and written into the supply chain contract list.

7. The method according to claim 6, characterized in that The types of contract updates include deleting a contract, adding a new contract, and modifying a contract.

Images