CN114677114A

CN114677114A - Approval process generation method and device based on graph dragging

Info

Publication number: CN114677114A
Application number: CN202210308893.0A
Authority: CN
Inventors: 林霄楠
Original assignee: Industrial and Commercial Bank of China Ltd ICBC
Current assignee: Industrial and Commercial Bank of China Ltd ICBC
Priority date: 2022-03-25
Filing date: 2022-03-25
Publication date: 2022-06-28

Abstract

The disclosure provides an approval process generation method based on graph dragging, which can be applied to the technical field of finance. The approval process generation method based on graph dragging comprises the following steps: acquiring a node information basic table and an entry condition definition table configured by a user; creating a plurality of process nodes according to the node information basic table; determining the position relation and the connection relation of the plurality of process nodes in response to the dragging operation and the connection operation of a user; generating a node position definition table according to the position relationship and the connection relationship of the plurality of process nodes; and generating an approval process according to the node information basic table, the node position definition table and the entry condition definition table. The disclosure also provides an approval process device, equipment, a storage medium and a program product based on graph dragging.

Description

Approval process generation method and device based on graph dragging

Technical Field

The present disclosure relates to the field of computer technologies, and in particular, to the field of system process design, and more particularly, to an approval process generation method, apparatus, device, storage medium, and program product based on graph dragging.

Background

In the internal management of an enterprise, a plurality of business approval processes often exist, when complex business approval process on-line processing is realized through a system, a traditional mode is that a plurality of sets of approval flows are developed according to different business types and branch conditions so as to meet the actual requirements of a large number of complex business approval processes, however, the realization mode has a large amount of repeated development workload; developers need to be familiar with complex business processes, the requirements on the developers are high, and the development difficulty is high.

It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.

Disclosure of Invention

In view of the foregoing, the present disclosure provides an approval process generation method, apparatus, device, storage medium, and program product based on graph drag.

According to a first aspect of the present disclosure, there is provided an approval process generation method based on graph dragging, including: acquiring a node information basic table and an entry condition definition table configured by a user;

creating a plurality of process nodes according to the node information basic table;

determining the position relation and the connection relation of the plurality of process nodes in response to the dragging operation and the connection operation of a user;

generating a node position definition table according to the position relationship and the connection relationship of the plurality of process nodes; and

and generating an approval process according to the node information basic table, the node position definition table and the entry condition definition table.

According to an embodiment of the present disclosure, the creating a plurality of process nodes according to the node information base table includes:

determining basic node information according to a node information basic table, wherein the basic node information comprises mechanism information, node names, node types, examination and approval role information and processing modes, and the processing modes comprise a specified examination and approval mode and a competitive examination and approval mode; and

and encapsulating the basic node information in the process node.

According to an embodiment of the present disclosure, the determining the position relationships and the connection relationships of the plurality of process nodes in response to a drag operation and a connection operation of a user includes:

responding to the dragging operation of a user, and determining the position information of each process node;

determining the position relation of the plurality of process nodes according to the position information of each process node;

responding to the connection operation of a user, and determining the connection relation between two process nodes connected by each connection operation;

and determining the connection relation of the plurality of process nodes according to the connection relation between the two process nodes connected by each connection operation.

According to an embodiment of the present disclosure, the generating an approval process according to the node information base table, the node location definition table, and the entry condition definition table includes:

determining an approval process connecting line path according to the node position definition table and the node information basic table;

and generating an approval process according to the entrance condition definition table and the approval process connecting line path.

According to an embodiment of the present disclosure, the determining an approval process connection path according to the node location definition table and the node information base table includes:

determining a front node and a rear node of any process node according to the node position definition table so as to determine the circulation direction of any process node; and

and determining an approval process connection line path according to the circulation direction.

According to an embodiment of the present disclosure, the generating an approval process according to the entry condition definition table and the approval process connection path includes:

determining a front node name, a rear node name and condition definition information according to an entry condition definition table, wherein the condition definition information comprises a condition type, a condition value and a logic judgment relation;

determining an entrance condition position according to the front node name and the rear node name; and

and setting the condition definition information in the link path of the approval process according to the entry condition position to generate an approval process.

According to the embodiment of the present disclosure, after the generating of the approval process, the method further includes:

the integrity of the approval process is checked and,

wherein the integrity check condition includes: all process nodes have a front node and a rear node, and the entry conditions of the approval processes are complete, the same entry conditions do not exist, and the completely same process nodes do not exist.

A second aspect of the present disclosure provides an approval process generation apparatus based on graph dragging, including: the acquisition module is used for acquiring a node information basic table and an entry condition definition table configured by a user;

the flow node creating module is used for creating a plurality of flow nodes according to the node information basic table;

the determining module is used for responding to the dragging operation and the connection operation of a user and determining the position relation and the connection relation of the flow nodes;

the first generation module is used for generating a node position definition table according to the position relation and the connection relation of the plurality of process nodes; and

and the second generation module is used for generating an approval process according to the node information basic table, the node position definition table and the entry condition definition table.

A third aspect of the present disclosure provides an electronic device, comprising: one or more processors; the memory is used for storing one or more programs, wherein when the one or more programs are executed by the one or more processors, the one or more processors are used for executing the method for generating the approval process based on the graph dragging.

The fourth aspect of the present disclosure further provides a computer-readable storage medium, on which executable instructions are stored, and when executed by a processor, the instructions cause the processor to execute the method for generating an approval process based on a graph drag.

A fifth aspect of the present disclosure also provides a computer program product, which includes a computer program, and when the computer program is executed by a processor, the method for generating an approval process based on graph drag is implemented.

According to the method provided by the embodiment of the disclosure, the process nodes are created by obtaining the node information basic table configured by the user, the position relations and the connection relations of the plurality of process nodes are determined in response to the dragging operation and the connection operation of the user, the arrangement and the connection of the nodes of the approval process are completed through the image dragging component, the actual configuration conversion from the graphic presentation to the system approval process is realized through the process configuration engine component according to the node information basic table and the entry condition definition table, the approval process is generated, and the generation method of the approval process in the graphic dragging mode is more flexible compared with the prior art, can add complex business logic and conditions to the process, reduces the development cost and improves the user experience.

Drawings

The foregoing and other objects, features and advantages of the disclosure will be apparent from the following description of embodiments of the disclosure, which proceeds with reference to the accompanying drawings, in which:

FIG. 1 schematically illustrates an application scenario diagram of a method, apparatus, device, storage medium and program product for generating an approval flow based on graphical drag according to an embodiment of the present disclosure;

FIG. 2 schematically illustrates a flow diagram of a method for generating an approval process based on graphical drag according to an embodiment of the present disclosure;

FIG. 3 schematically shows a flow chart of a method of creation of a flow node according to an embodiment of the present disclosure;

fig. 4 schematically shows a flowchart of a method for determining a location relationship and a connection relationship of a flow node according to an embodiment of the present disclosure;

FIG. 5 schematically illustrates a flow diagram of an approval flow generation method according to an embodiment of the present disclosure;

FIG. 6 is a block diagram schematically illustrating an apparatus for generating an approval flow based on a graph drag according to an embodiment of the present disclosure; and

FIG. 7 schematically illustrates a block diagram of an electronic device suitable for implementing a graphical drag-based approval process generation method according to an embodiment of the present disclosure.

Detailed Description

Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.

All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.

Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).

In the internal management of an enterprise, a complex business approval process exists, and the traditional mode is to develop a plurality of sets of approval flows according to different business types and branches so as to meet the requirements of a large number of complex business approvals. In addition, when any change occurs in the business approval process, the system needs to be upgraded and modified synchronously, and the system stability is poor.

Based on the technical problem, an embodiment of the present disclosure provides an approval process generation method based on graph dragging, including: acquiring a node information basic table and an entry condition definition table configured by a user; creating a plurality of process nodes according to the node information basic table; determining the position relation and the connection relation of the plurality of process nodes in response to the dragging operation and the connection operation of a user; generating a node position definition table according to the position relationship and the connection relationship of the plurality of process nodes; and generating an approval process according to the node information basic table, the node position definition table and the entry condition definition table.

Fig. 1 schematically illustrates an application scenario diagram of a method, an apparatus, a device, a storage medium, and a program product for generating an approval flow based on graph drag according to an embodiment of the present disclosure.

As shown in fig. 1, an application scenario 100 according to this embodiment may include a creation scenario of an approval process. Network 104 is the medium used to provide communication links between

terminal devices

101, 102, 103 and server 105. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.

The user may use the

terminal devices

101, 102, 103 to interact with the server 105 via the network 104 to receive or send messages or the like. The

terminal devices

101, 102, 103 may have installed thereon various communication client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).

The

terminal devices

101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.

The server 105 may be a server providing various services, such as a background management server (for example only) providing support for websites browsed by users using the

terminal devices

101, 102, 103. The background management server can process the received data such as the node information basic table configured by the user and the dragging and connecting operation of the user, and feed back the processing result (such as generating an approval process according to the dragging operation of the user) to the terminal equipment.

It should be noted that the approval process generation method based on the graph drag provided by the embodiment of the present disclosure may be generally executed by the server 105. Accordingly, the approval process generation apparatus based on graphical drag provided by the embodiments of the present disclosure may be generally disposed in the server 105. The approval process generation method based on graphical drag provided by the embodiment of the present disclosure may also be executed by a server or a server cluster that is different from the server 105 and can communicate with the

terminal devices

101, 102, 103 and/or the server 105. Correspondingly, the approval process generation device based on the graph drag provided by the embodiment of the present disclosure may also be disposed in a server or a server cluster different from the server 105 and capable of communicating with the

terminal devices

101, 102, and 103 and/or the server 105.

It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.

The method for generating the approval process based on the graph drag according to the disclosed embodiment will be described in detail below with reference to fig. 2 to 5 based on the scenario described in fig. 1.

FIG. 2 schematically shows a flowchart of a method for generating an approval flow based on graphical drag according to an embodiment of the present disclosure.

As shown in fig. 2, the method for generating an approval flow based on graphical drag of this embodiment includes operations S210 to S250, and the method may be executed by a server or a computing device.

In operation S210, a user-configured node information base table and an entry condition definition table are acquired.

In operation S220, a plurality of process nodes are created according to the node information base table.

In one example, in the process of establishing the approval process, the setting of the approval process nodes depends on a graph dragging component, the component includes a starting node, a link node, a concurrent node, a sink node and a finishing node, the starting node is a process initiating location, the link node, the concurrent node and the sink node are intermediate links of the approval process, and various service elements of the link process, namely, information such as names, approval roles and processing modes of the process nodes, need to be defined and stored in a node information base table.

Firstly, creating an approval process name for explaining a specific service acted by the approval process, setting a starting node and an ending node in an approval flow by default, and needing to create a process node by a user. The entry condition definition table is related to specific service logic and comprises information such as judgment positions, judgment contents and judgment logic of entry conditions. The specific creation process of the flow node can refer to operations S221 to S222 described in fig. 3.

In operation S230, in response to a drag operation and a connection operation of a user, a positional relationship and a connection relationship of the plurality of process nodes are determined.

In operation S240, a node position definition table is generated according to the position relationships and the connection relationships of the plurality of process nodes.

In one example, after the process nodes are created, a user can move each process node in a manual dragging mode, the graph dragging component determines the position information of the dragged process node after recognizing the dragging operation of the user, and determines the connection relation between the connected process nodes after recognizing the connection operation of the user. The position relation and the connection relation of the process nodes are stored in a node position definition table, the sequence, the arrangement and the connection relation of each node can be obtained according to the node position definition table, and the node position definition table comprises a node name, a front node name, a rear node name, a concurrent identifier and a convergence identifier. When node records of the same prepositive link appear, the concurrency mark is registered as '1-yes'; when the postposition links of a plurality of concurrent nodes are the same link, the link aggregation mark is registered as '1-yes', and the same link can be a concurrent link and an aggregation link at the same time.

In operation S250, an approval process is generated according to the node information base table, the node location definition table, and the entry condition definition table.

In one example, after a user finishes the arrangement and connection of each process node of the approval process through the graph dragging component, the process configuration engine component finishes the actual configuration conversion from the process graph presentation to the system approval process according to the node information base table, the node position definition table and the entry condition definition table, generates the approval process, and realizes the independent editing of the approval process. See, in particular, operations S251 through S252 shown in fig. 5.

Next, a process of creating a flow node will be described with reference to fig. 3, and fig. 3 schematically shows a flow chart of a method of creating a flow node according to an embodiment of the present disclosure. As shown in fig. 3, operation S220 includes operations S221 through S222.

In operation S221, node basic information is determined according to the node information base table. In operation S222, the node basic information is encapsulated in a flow node.

According to the embodiment of the disclosure, the basic information of the node comprises mechanism information, a node name, a node type, approval role information and processing modes, wherein the processing modes comprise a specified approval mode and a competitive approval mode.

In one example, the node information base table is node information configured by a user according to actual service needs, and the basic information of each node can be determined according to the table, wherein the basic information comprises organization information, a node name, a node type, examination and approval role information and a processing mode, the organization information comprises the organization name and an organization code, which mechanism or department the examination and approval role of the process belongs to is represented, the node type represents whether the current process node belongs to a sink node or a concurrent node, and different service logics can be clearly represented; the processing mode comprises two modes of specifying an approver and competing all approvers. And designating the approvers to carry out approval to the fixed approvers, wherein the competition mode means that all the approvers with rechecking conditions can complete approval. And the information related to the approval business is packaged in the process nodes, and different nodes represent different links in the business process.

After the process node is created, the user needs to determine the position and the connection relation of the process node in a dragging manner according to the business approval process.

Fig. 4 schematically shows a flowchart of a method for determining a location relationship and a connection relationship of a flow node according to an embodiment of the present disclosure. As shown in fig. 4, operation S230 includes operations S231 through S234.

In operation S231, position information of each flow node is determined in response to a drag operation of a user. In operation S232, the position relationship of the plurality of process nodes is determined according to the position information of each process node. In operation S233, a connection relationship between two process nodes connected by a connection operation each time is determined in response to the connection operation by the user. In operation S234, the connection relationship of the plurality of process nodes is determined according to the connection relationship between the two process nodes connected by each connection operation.

In one example, a user determines position information of a process node through a dragging operation, for example, a front-back sequence between two nodes is determined to represent a sequence of a business approval process flow, and a connection relationship between the two process nodes is determined through a connection operation to represent a direction of the business approval process flow; and determining the position information of all the nodes according to the position information of each process node, connecting the process nodes in series according to the node names and the corresponding connection relation to realize the arrangement of the process nodes, and storing the information into a node position definition table.

Fig. 5 schematically shows a flow chart of an approval flow generation method according to an embodiment of the present disclosure. As shown in fig. 5, operation S250 includes operations S251 to 252.

In operation S251, an approval process connection path is determined according to the node location definition table and the node information base table.

According to the embodiment of the disclosure, a front node and a rear node of any flow node are determined according to the node position definition table so as to determine the flow direction of any flow node; and determining an approval process connection line path according to the circulation direction.

In one example, the node location definition table includes a node name, a front node of the node, a back node of the node, and a type identifier of the node, i.e., a concurrent identifier and an aggregation identifier, which characterize which node the current node is. The link path of the approval process can be determined according to the node position definition table, and since many logic judgment conditions exist in the actual approval process, the business logic needs to be added to the link path of the approval process by the entry condition definition table.

In operation S252, an approval process is generated according to the entry condition definition table and the approval process connection path.

According to the embodiment of the disclosure, a preposed node name, a postpositional node name and condition definition information are determined according to an entry condition definition table, wherein the condition definition information comprises a condition type, a condition numerical value and a logic judgment relation; determining an entrance condition position according to the front node name and the rear node name; and setting the condition definition information in the link path of the approval process according to the entry condition position to generate an approval process.

In one example, each concurrent link in the same hierarchy performs flow path differentiation according to an entry condition, a judgment element needs to be set in the entry condition, the judgment element is stored in an entry condition definition table, where last _ link is a front link, next _ link is a back link and is used for defining a judgment position of the entry condition, condition _ type is a condition type and can set judgment content such as information of amount, days, event and the like, condition _ value is a condition numerical value and is used for referring to a specific threshold value of the condition type, correlation _ flag is a relationship flag and is used for defining a relationship of "and" or "between entry conditions, for example, if an entry condition is set to" and ", then a corresponding back link can be entered only when a plurality of set entry conditions are simultaneously satisfied; if the entry condition is 'OR', the corresponding post link can be entered when only one entry condition is satisfied. And the system judges the conditions according to the link path of the approval flow to identify a correct path, and the approval process is finally ended by finishing the node.

After the approval process is generated, the integrity of the approval process needs to be checked before the approval flow takes effect, and according to the embodiment of the disclosure, the integrity checking condition includes:

all the process nodes have a front node and a rear node, namely, whether all the nodes comprise the front node and the rear node is judged; whether there are exactly the same flow nodes.

The entry conditions of the approval process are complete and the same entry conditions do not exist, that is, whether all the entry conditions are crossed is judged, specifically, whether the "and" entry conditions of two identical condition types and condition values exist or whether the entry conditions of a certain condition type and condition value do not set a front node or a rear node, so that the entry conditions are incomplete and unavailable.

Based on the approval process generation method based on the graph dragging, the disclosure also provides an approval process generation device based on the graph dragging. The apparatus will be described in detail below with reference to fig. 7.

Fig. 6 is a block diagram schematically illustrating a structure of an approval process generation apparatus based on a graph drag according to an embodiment of the present disclosure.

As shown in fig. 6, the apparatus 800 for generating an approval flow based on graph drag according to this embodiment includes an obtaining module 810, a flow node creating module 820, a determining module 830, a first generating module 840, and a second generating module 850.

The obtaining module 810 is configured to obtain a node information base table and an entry condition definition table configured by a user. In an embodiment, the obtaining module 810 may be configured to perform the operation S210 described above, which is not described herein again.

The flow node creating module 820 is used for creating a plurality of flow nodes according to the node information basic table. In an embodiment, the flow node creating module 820 may be configured to perform the operation S220 described above, which is not described herein again.

The determining module 830 is configured to determine the position relationships and the connection relationships of the multiple process nodes in response to a drag operation and a connection operation of a user. In an embodiment, the determining module 830 may be configured to perform the operation S230 described above, and is not described herein again.

The first generating module 840 is configured to generate a node position definition table according to the position relationships and the connection relationships of the plurality of process nodes. In an embodiment, the first generating module 840 may be configured to perform the operation S240 described above, which is not described herein again.

The second generating module 850 is configured to generate an approval process according to the node information base table, the node location definition table, and the entry condition definition table. In an embodiment, the second generating module 830 may be configured to perform the operation S250 described above, and is not described herein again.

According to an embodiment of the present disclosure, the flow node creation module 820 includes a first determination submodule 821 and a generation submodule 822.

The first determining submodule 821 is used for determining basic node information according to the node information base table. In an embodiment, the first determining sub-module 821 may be configured to perform the operation S221 described above, and will not be described herein again.

The generating sub-module 821 is used for packaging the node basic information in the process node. In an embodiment, the generating submodule 821 may be configured to perform the operation S222 described above, and will not be described herein again.

According to an embodiment of the present disclosure, the determination module 830 includes a second determination submodule 831, a third determination submodule 832, a fourth determination submodule 833, and a fifth determination submodule 834.

The second determining submodule 831 is configured to determine the position information of each flow node in response to a drag operation by the user. In an embodiment, the second determining sub-module 831 may be configured to perform the operation S231 described above, and will not be described herein again.

The third determining sub-module 832 is configured to determine the location relationship of the plurality of process nodes according to the location information of each process node. In an embodiment, the third determining submodule 832 may be configured to perform the operation S232 described above, and will not be described herein again.

The fourth determining sub-module 833 is used for determining the connection relationship between the two process nodes connected by the connection operation each time in response to the connection operation of the user. In an embodiment, the fourth determining sub-module 833 may be configured to perform the operation S233 described above, and is not described herein again.

The fifth determining sub-module 834 is configured to determine a connection relationship between the plurality of process nodes according to the connection relationship between the two process nodes connected in each connection operation. In an embodiment, the fifth determining sub-module 834 may be configured to perform the operation S234 described above, and will not be described herein again.

According to an embodiment of the present disclosure, the second generation module 850 includes a sixth determination sub-module 851 and a generation sub-module 852.

The sixth determining sub-module 851 is configured to determine an approval process connection path according to the node location definition table and the node information base table. In an embodiment, the sixth determining sub-module 851 may be configured to perform the operation S251 described above, and is not described herein again.

The generating sub-module 852 is configured to generate an approval process according to the entry condition definition table and the approval process connection path. In an embodiment, the generating sub-module 852 may be configured to perform the operation S252 described above, which is not described herein again.

According to the embodiment of the disclosure, any plurality of the obtaining module 810, the flow node creating module 820, the determining module 830, the first generating module 840, and the second generating module 850 may be combined and implemented in one module, or any one of the modules may be split into a plurality of modules. Alternatively, at least part of the functionality of one or more of these modules may be combined with at least part of the functionality of the other modules and implemented in one module. According to an embodiment of the disclosure, at least one of the obtaining module 810, the flow node creating module 820, the determining module 830, the first generating module 840, and the second generating module 850 may be implemented at least partially as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in hardware or firmware in any other reasonable manner of integrating or packaging a circuit, or in any one of three implementations of software, hardware, and firmware, or in a suitable combination of any of them. Alternatively, at least one of the obtaining module 810, the flow node creating module 820, the determining module 830, the first generating module 840 and the second generating module 850 may be at least partially implemented as a computer program module, which when executed, may perform a corresponding function.

As shown in fig. 7, an electronic apparatus 900 according to an embodiment of the present disclosure includes a processor 901 which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)902 or a program loaded from a storage portion 908 into a Random Access Memory (RAM) 903. Processor 901 may comprise, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 901 may also include on-board memory for caching purposes. The processor 901 may comprise a single processing unit or a plurality of processing units for performing the different actions of the method flows according to embodiments of the present disclosure.

In the RAM 903, various programs and data necessary for the operation of the electronic apparatus 900 are stored. The processor 901, the ROM 902, and the RAM 903 are connected to each other through a bus 904. The processor 901 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM 902 and/or the RAM 903. Note that the programs may also be stored in one or more memories other than the ROM 902 and the RAM 903. The processor 901 may also perform various operations of the method flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.

Electronic device 900 may also include input/output (I/O) interface 905, input/output (I/O) interface 905 also connected to bus 904, according to an embodiment of the present disclosure. The electronic device 900 may also include one or more of the following components connected to the I/O interface 905: an input portion 906 including a keyboard, a mouse, and the like; an output section 907 including components such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 908 including a hard disk and the like; and a communication section 909 including a network interface card such as a LAN card, a modem, or the like. The communication section 909 performs communication processing via a network such as the internet. The drive 910 is also connected to the I/O interface 905 as necessary. A removable medium 911 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 910 as necessary, so that a computer program read out therefrom is mounted into the storage section 908 as necessary.

The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/device/system described in the above embodiments; or may exist alone without being assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.

According to embodiments of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, which may include, for example but is not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. For example, according to embodiments of the present disclosure, a computer-readable storage medium may include the ROM 902 and/or the RAM 903 described above and/or one or more memories other than the ROM 902 and the RAM 903.

Embodiments of the present disclosure also include a computer program product comprising a computer program containing program code for performing the method illustrated in the flow chart. When the computer program product runs in a computer system, the program code is used for causing the computer system to realize the method for generating the approval flow based on the graph dragging provided by the embodiment of the disclosure.

The computer program performs the above-described functions defined in the system/apparatus of the embodiments of the present disclosure when executed by the processor 901. The systems, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.

In one embodiment, the computer program may be hosted on a tangible storage medium such as an optical storage device, a magnetic storage device, or the like. In another embodiment, the computer program may also be transmitted, distributed in the form of a signal on a network medium, and downloaded and installed through the communication section 909 and/or installed from the removable medium 911. The computer program containing program code may be transmitted using any suitable network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.

In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 909, and/or installed from the removable medium 911. The computer program, when executed by the processor 901, performs the above-described functions defined in the system of the embodiment of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.

In accordance with embodiments of the present disclosure, program code for executing computer programs provided by embodiments of the present disclosure may be written in any combination of one or more programming languages, and in particular, these computer programs may be implemented using high level procedural and/or object oriented programming languages, and/or assembly/machine languages. The programming language includes, but is not limited to, programming languages such as Java, C + +, python, the "C" language, or the like. The program code may execute entirely on the user computing device, partly on the user device, partly on a remote computing device, or entirely on the remote computing device or server. In situations involving remote computing devices, the remote computing devices may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to external computing devices (e.g., through the internet using an internet service provider).

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.

The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.

Claims

1. An approval process generation method based on graph dragging is characterized by comprising the following steps:

acquiring a node information basic table and an entry condition definition table configured by a user;

2. The method of claim 1, wherein creating a plurality of process nodes from a node information base table comprises:

and encapsulating the basic node information in the process node.

3. The method according to claim 1, wherein the determining the position relationship and the connection relationship of the plurality of process nodes in response to a drag operation and a connection operation of a user comprises:

determining the position information of each process node in response to the dragging operation of a user;

responding to the connection operation of a user, and determining the connection relationship between two process nodes connected by each connection operation;

4. The method of claim 1, wherein generating an approval process according to the node information base table, the node location definition table, and the entry condition definition table comprises:

5. The method of claim 4, wherein determining an approval process connection path according to the node location definition table and the node information base table comprises:

6. The method of claim 4, wherein generating an approval process according to the entry condition definition table and the approval process connection path comprises:

7. The method of any one of claims 1 to 6, further comprising, after generating the approval process:

the integrity of the approval process is checked,

wherein the integrity check condition includes: all process nodes have a front node and a rear node, the entry conditions of the approval process are complete, the same entry conditions do not exist, and the identical process nodes do not exist.

8. An approval process generation device based on graph dragging comprises the following steps:

the acquisition module is used for acquiring a node information basic table and an entry condition definition table configured by a user;

9. An electronic device, comprising:

one or more processors;

a storage device for storing one or more programs,

wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-7.

10. A computer readable storage medium having stored thereon executable instructions which, when executed by a processor, cause the processor to perform the method of any one of claims 1 to 7.

11. A computer program product comprising a computer program which, when executed by a processor, implements a method according to any one of claims 1 to 7.