CN112766646B - Method, device, equipment and storage medium for generating and processing task flow - Google Patents

Method, device, equipment and storage medium for generating and processing task flow Download PDF

Info

Publication number
CN112766646B
CN112766646B CN202011611307.7A CN202011611307A CN112766646B CN 112766646 B CN112766646 B CN 112766646B CN 202011611307 A CN202011611307 A CN 202011611307A CN 112766646 B CN112766646 B CN 112766646B
Authority
CN
China
Prior art keywords
task
node
aggregation
flow
update
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.)
Active
Application number
CN202011611307.7A
Other languages
Chinese (zh)
Other versions
CN112766646A (en
Inventor
杨勇勇
李璇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Dajia Internet Information Technology Co Ltd
Original Assignee
Beijing Dajia Internet Information Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Dajia Internet Information Technology Co Ltd filed Critical Beijing Dajia Internet Information Technology Co Ltd
Priority to CN202011611307.7A priority Critical patent/CN112766646B/en
Publication of CN112766646A publication Critical patent/CN112766646A/en
Application granted granted Critical
Publication of CN112766646B publication Critical patent/CN112766646B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/901—Indexing; Data structures therefor; Storage structures
    • G06F16/9027—Trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/906—Clustering; Classification

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Databases & Information Systems (AREA)
  • Human Resources & Organizations (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Educational Administration (AREA)
  • Development Economics (AREA)
  • Software Systems (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The present disclosure relates to a method, an apparatus, a device and a storage medium for generating and processing a task flow, and relates to the technical field of data processing, wherein the method for generating the task flow comprises the following steps: receiving a first task process generation request, wherein the first task process generation request comprises one or more task nodes and a circulation relation among the task nodes; constructing a task flow tree based on the circulation relationship among the task nodes; the task flow tree comprises each task node; for any task node, one or more tasks of any task node and the flow relationship among the tasks are obtained, a task aggregation flow tree of any task node is constructed based on the flow relationship among the tasks, and any task node and the task aggregation flow tree are associated. Therefore, by establishing the task aggregation process tree of each task node, the task aggregation nodes and/or the operation nodes in the task aggregation process tree can be updated to flexibly update the operation nodes, and the flexibility of approval operation is improved.

Description

Method, device, equipment and storage medium for generating and processing task flow
Technical Field
The present disclosure relates to the field of data processing technologies, and in particular, to a method, an apparatus, a device, and a storage medium for generating and processing a task flow.
Background
At present, a business approval business of an enterprise drives the flow of a flow according to related factors such as document content, an initiator, a current approver and the like by configuring a flow flowing template.
In the related art, a process developer designs a flow chart according to business requirements, and configures an executor of a current node on the flow chart, as shown in fig. 1, the developer configures an executor of a node on the related node, for example, configures a role of department leader on "department leader approval," and when a process flow is transferred to the department leader approval, a process engine creates a corresponding process task node according to the configured executor, however, the process operation nodes are fixed and cannot support flexible scenarios such as front-end tagging and back-end tagging.
Disclosure of Invention
The present disclosure provides a method, an apparatus, a device, and a storage medium for generating a task flow, so as to at least solve the problem in the related art that an operation node is fixed in a task flow and cannot meet a scenario of a newly added operation node. The technical scheme of the disclosure is as follows:
according to a first aspect of the embodiments of the present disclosure, a method for generating a task flow is provided, including:
receiving a first task process generation request, wherein the first task process generation request comprises one or more task nodes and a circulation relationship among the task nodes;
constructing a task flow tree based on the circulation relationship among the task nodes; wherein the task flow tree comprises each task node;
for any task node, acquiring one or more tasks of the task node and a flow relation between the tasks, constructing a task aggregation flow tree of the task node based on the flow relation between the tasks, and associating the task node with the task aggregation flow tree;
the task aggregation flow tree comprises a task aggregation node layer and a task operation node layer, wherein the task aggregation node layer comprises task aggregation nodes corresponding to tasks, the flow relation among the task aggregation nodes corresponds to the flow relation among the tasks, and the task operation node layer comprises one or more operation nodes corresponding to the tasks; and the operation node and the task aggregation node corresponding to any task are associated.
In an embodiment of the present disclosure, the constructing a task aggregation flow tree of any task node based on a flow relationship between tasks includes:
creating task aggregation nodes corresponding to the tasks, and creating a circulation relation between the task aggregation nodes corresponding to the tasks based on the circulation relation between the tasks; for any task, creating an operation node corresponding to the task according to configuration information of the task corresponding to the task aggregation node corresponding to the task, associating the task aggregation node corresponding to the task with the operation node corresponding to the task, and constructing a task aggregation flow tree of the task node;
the associating of the any task node and the task aggregation flow tree includes: and associating any task node with the task aggregation node corresponding to each task.
In an embodiment of the present disclosure, the method further includes:
receiving a second task flow generation request, wherein the second task flow generation request comprises a target operation node, one or more operation tasks of the target operation node and a circulation relation among the operation tasks;
based on the circulation relationship among the operation tasks, constructing an operation task aggregation flow tree of the target operation node, and associating the target operation node and the operation task aggregation flow tree;
the operation task aggregation flow tree comprises an operation task aggregation node layer and an operation task operation node layer, wherein the operation task aggregation node layer comprises operation task aggregation nodes corresponding to the operation tasks respectively, the circulation relationship among the operation task aggregation nodes corresponds to the circulation relationship among the operation tasks, and the operation task operation node layer comprises one or more operation nodes corresponding to the operation tasks respectively; and the operation node corresponding to any operation task is associated with the operation task aggregation node.
According to a second aspect of the embodiments of the present disclosure, there is provided a method for generating a task flow, including:
receiving a task flow updating request, wherein the task flow updating request comprises a target task node;
the target task node is provided with an associated task aggregation flow tree, the task aggregation flow tree comprises a task aggregation node layer and a task operation node layer, the task aggregation node layer comprises task aggregation nodes corresponding to the tasks, the circulation relationship among the task aggregation nodes corresponds to the circulation relationship among the tasks, and the task operation node layer comprises one or more operation nodes corresponding to the tasks; the operation node and the task aggregation node corresponding to any task are associated;
acquiring an update task of the target task node;
and updating the task aggregation flow tree according to the update task.
In an embodiment of the present disclosure, the updating the task aggregation flow tree according to the update task includes:
creating an update task aggregation node and an update operation node corresponding to the update task, and associating the update task aggregation node and the update operation node;
inserting the update task aggregation node according to the position of the update task aggregation node in the task aggregation flow tree, and associating the update task aggregation node with task aggregation nodes before and after the update task aggregation node, or associating the update task aggregation node with task aggregation nodes before the update task aggregation node, or associating the update task aggregation node with operation nodes after the update task aggregation node;
or
Creating an updating operation node corresponding to the updating task;
and inserting the update operation node according to the position of the update operation node in the task aggregation flow tree, and associating the update operation node and operation nodes before and after the update operation node, or associating the update operation node and operation nodes before the update operation node, or associating the update operation node and operation nodes after the update operation node.
In an embodiment of the present disclosure, the updating the task aggregation flow tree according to the update task includes:
deleting the task aggregation node to be deleted and/or the operation node to be deleted corresponding to the update task;
and associating the task aggregation nodes before and after the task aggregation node to be deleted and/or associating the operation nodes before and after the operation node to be deleted according to the positions of the task aggregation node to be deleted and/or the operation node to be deleted in the task aggregation flow tree.
In an embodiment of the present disclosure, the updating the task aggregation flow tree according to the update task includes:
determining a task aggregation node to be changed and/or an operation node to be changed corresponding to the update task and change associated information;
and in the task aggregation flow tree, the association relation of the task aggregation node to be changed and/or the operation node to be changed is changed according to the change association information.
According to a third aspect of the embodiments of the present disclosure, there is provided a method for processing a task flow, including:
receiving an operation instruction by an operation node corresponding to the current task;
transmitting an operation result corresponding to the operation instruction to a current task aggregation node corresponding to the current task;
determining the task state of the current task according to the task setting information of the task corresponding to the current task aggregation node and the operation result;
and when the task state of each task aggregation node is passed, jumping to the next task node according to the circulation relationship between the task nodes.
In an embodiment of the present disclosure, the determining a task state of the current task according to the task setting information of the task corresponding to the current task aggregation node and the operation result includes:
according to the task setting information of the task corresponding to the current task aggregation node, determining that the task state of the current task is passed under the condition that the operation result corresponding to the associated operation node corresponding to the current task aggregation node is passed;
and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
In an embodiment of the present disclosure, the determining a task state of the current task according to the task setting information of the task corresponding to the current task aggregation node and the operation result includes:
according to the task setting information of the task corresponding to the current task aggregation node, determining that the task state of the current task is passed under the condition that an operation result corresponding to any operation node corresponding to the current task aggregation node is passed;
and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
In an embodiment of the present disclosure, the determining a task state of the current task according to the task setting information of the task corresponding to the current task aggregation node and the operation result includes:
according to the task setting information of the task corresponding to the current task aggregation node, determining that the task state of the current task is passed under the condition that the operation result corresponding to the operation node with the preset value corresponding to the current task aggregation node is passed;
and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
In an embodiment of the present disclosure, the method for processing a task flow further includes:
and returning to the previous task aggregation node or jumping to a task processing request initiator under the condition that the task state of the current task is failed.
According to a fourth aspect of the embodiments of the present disclosure, there is provided a task flow generation apparatus, including:
a first receiving unit configured to receive a first task flow generation request, where the first task flow generation request includes one or more task nodes and a flow relationship between the task nodes;
the first construction unit is configured to construct a task flow tree based on the circulation relationship among the task nodes; wherein the task flow tree comprises each task node;
the task management system comprises a first acquisition unit, a second acquisition unit and a processing unit, wherein the first acquisition unit is configured to acquire one or more tasks of any task node and a flow relationship among the tasks for the task node;
the second construction unit is configured to construct a task aggregation flow tree of any task node based on a flow relationship among tasks;
the association unit is configured to associate the any task node with the task aggregation flow tree;
the task aggregation flow tree comprises a task aggregation node layer and a task operation node layer, wherein the task aggregation node layer comprises task aggregation nodes corresponding to tasks, the flow relation among the task aggregation nodes corresponds to the flow relation among the tasks, and the task operation node layer comprises one or more operation nodes corresponding to the tasks; and the operation node and the task aggregation node corresponding to any task are associated.
In an embodiment of the disclosure, the second building unit is specifically configured to:
creating task aggregation nodes corresponding to the tasks, and creating a circulation relation between the task aggregation nodes corresponding to the tasks based on the circulation relation between the tasks; for any task, creating an operation node corresponding to the task, associating a task aggregation node corresponding to the task and the operation node corresponding to the task, and constructing a task aggregation flow tree of the task node;
the associating of the any task node and the task aggregation flow tree includes: and associating any task node with the task aggregation node corresponding to each task.
In an embodiment of the present disclosure, the apparatus further includes:
a second receiving unit, configured to receive a second task flow generation request, where the second task flow generation request includes a target operation node, one or more operation tasks of the target operation node, and a flow relationship between the operation tasks;
a third construction unit, configured to construct an operation task aggregation flow tree of the target operation node based on the flow relationship among the operation tasks, and associate the target operation node and the operation task aggregation flow tree;
the operation task aggregation flow tree comprises an operation task aggregation node layer and an operation task operation node layer, wherein the operation task aggregation node layer comprises operation task aggregation nodes corresponding to the operation tasks respectively, the circulation relationship among the operation task aggregation nodes corresponds to the circulation relationship among the operation tasks, and the operation task operation node layer comprises one or more operation nodes corresponding to the operation tasks respectively; and the operation node corresponding to any operation task is associated with the operation task aggregation node.
According to a fifth aspect of the embodiments of the present disclosure, there is provided a task flow generation apparatus, including:
a third receiving unit configured to receive a task flow update request, where the task flow update request includes a target task node;
the target task node is provided with an associated task aggregation flow tree, the task aggregation flow tree comprises a task aggregation node layer and a task operation node layer, the task aggregation node layer comprises task aggregation nodes corresponding to the tasks, the circulation relationship among the task aggregation nodes corresponds to the circulation relationship among the tasks, and the task operation node layer comprises one or more operation nodes corresponding to the tasks; the operation node and the task aggregation node corresponding to any task are associated;
a second obtaining unit configured to obtain an update task of the target task node;
and the updating unit is configured to update the task aggregation flow tree according to the updating task.
In an embodiment of the present disclosure, the update unit is specifically configured to:
creating an update task aggregation node and an update operation node corresponding to the update task, and associating the update task aggregation node and the update operation node;
inserting the update task aggregation node according to the position of the update task aggregation node in the task aggregation flow tree, and associating the update task aggregation node with task aggregation nodes before and after the update task aggregation node, or associating the update task aggregation node with task aggregation nodes before the update task aggregation node, or associating the update task aggregation node with operation nodes after the update task aggregation node;
or
Creating an updating operation node corresponding to the updating task;
and inserting the update operation node according to the position of the update operation node in the task aggregation flow tree, and associating the update operation node and operation nodes before and after the update operation node, or associating the update operation node and operation nodes before the update operation node, or associating the update operation node and operation nodes after the update operation node.
In an embodiment of the present disclosure, the update unit is specifically configured to:
deleting the task aggregation node to be deleted and/or the operation node to be deleted corresponding to the update task;
and associating the task aggregation nodes before and after the task aggregation node to be deleted and/or associating the operation nodes before and after the operation node to be deleted according to the positions of the task aggregation node to be deleted and/or the operation node to be deleted in the task aggregation flow tree.
In an embodiment of the present disclosure, the update unit is specifically configured to:
determining a task aggregation node to be changed and/or an operation node to be changed corresponding to the update task and change associated information;
and in the task aggregation flow tree, the association relation of the task aggregation node to be changed and/or the operation node to be changed is changed according to the change association information.
According to a sixth aspect of the embodiments of the present disclosure, there is provided a processing apparatus of a task flow, including:
the fourth receiving unit is configured to receive the operation instruction by the operation node corresponding to the current task;
a transmission unit configured to transmit an operation result corresponding to the operation instruction to a current task aggregation node corresponding to the current task;
the determining unit is configured to determine the task state of the current task according to the task setting information of the task corresponding to the current task aggregation node and the operation result;
and the jumping unit is configured to jump to a task aggregation node of a next task according to the flow relationship among the task aggregation nodes when the task state of the current task is passed, and jump to the next task node according to the flow relationship among the task nodes when the task state of each task aggregation node is passed.
In an embodiment of the present disclosure, the determining unit is specifically configured to:
determining that the task state of the current task is passed under the condition that operation results corresponding to all operation nodes associated with the current task aggregation node are passed according to task setting information of the task corresponding to the current task aggregation node;
and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
In an embodiment of the present disclosure, the determining unit is specifically configured to:
according to the task setting information of the task corresponding to the current task aggregation node, determining that the task state of the current task is passed under the condition that an operation result corresponding to any operation node corresponding to the current task aggregation node is passed;
and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
In an embodiment of the present disclosure, the determining unit is specifically configured to:
according to the task setting information of the task corresponding to the current task aggregation node, determining that the task state of the current task is passed under the condition that the operation result corresponding to the operation node with the preset value corresponding to the current task aggregation node is passed;
and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
In an embodiment of the present disclosure, the processing apparatus of the task flow further includes:
and the returning unit is configured to return to the previous task aggregation node or jump to the task processing request initiator under the condition that the task state of the current task is failed.
According to a seventh aspect of the embodiments of the present disclosure, there is provided an electronic apparatus including:
a processor;
a memory for storing the processor-executable instructions;
the processor is configured to be the instruction, so as to implement the task flow generation method and the task flow processing method described in the foregoing embodiments.
According to an eighth aspect of the embodiments of the present disclosure, there is provided a storage medium, wherein when the instructions in the storage medium are executed by a processor of an electronic device, the electronic device is enabled to execute the method for generating a task flow and the method for processing the task flow according to the foregoing embodiments.
According to a ninth aspect of the embodiments of the present disclosure, there is provided a computer program product, wherein when the instructions in the computer program product are executed by a processor, the electronic device is enabled to execute the method for generating a task flow and the method for processing a task flow described in the foregoing embodiments.
The technical scheme provided by the embodiment of the disclosure at least brings the following beneficial effects:
receiving a first task process generation request, wherein the first task process generation request comprises one or more task nodes and a circulation relation among the task nodes; constructing a task flow tree based on the circulation relationship among the task nodes; the task flow tree comprises each task node; for any task node, one or more tasks of any task node and the flow relationship among the tasks are obtained, a task aggregation flow tree of any task node is constructed based on the flow relationship among the tasks, and any task node and the task aggregation flow tree are associated. Therefore, by establishing the task aggregation process tree corresponding to each task node, the task aggregation nodes and/or the operation nodes in the task aggregation process tree can be updated, so that the flexible addition of the operation nodes is realized, the problem that the operation nodes in the existing task process are fixed and cannot meet the requirement of a newly added operation node scene is solved, and the flexibility of approval operation is improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the principles of the disclosure and are not to be construed as limiting the disclosure.
FIG. 1 is an exemplary diagram illustrating a task flow according to one illustrative embodiment;
FIG. 2 is a flow diagram illustrating a method of generating a task flow in accordance with an exemplary embodiment;
FIG. 3 is an exemplary diagram illustrating the generation of a task flow in accordance with one illustrative embodiment;
FIG. 4 is an exemplary diagram illustrating the generation of a task flow in accordance with one illustrative embodiment;
FIG. 5 is an exemplary diagram illustrating the generation of a task flow in accordance with one illustrative embodiment;
FIG. 6 is a flow diagram illustrating another method of generating a task flow in accordance with an illustrative embodiment;
FIG. 7 is an exemplary diagram illustrating the generation of a task flow in accordance with one illustrative embodiment;
FIG. 8 is a flow diagram illustrating a method of generating yet another task flow in accordance with an illustrative embodiment;
FIG. 9 is a flowchart illustrating a method of processing a task flow in accordance with an exemplary embodiment;
FIG. 10 is an application scenario diagram illustrating a method of generating a task flow in accordance with an exemplary embodiment;
FIG. 11a is a task flow interface diagram of a terminal device shown in accordance with an exemplary embodiment;
FIG. 11b is a task flow interface diagram of a terminal device shown in accordance with an exemplary embodiment;
FIG. 12 is a block diagram illustrating a means for generating a task flow in accordance with an exemplary embodiment;
FIG. 13 is a block diagram illustrating a means for generating a task flow in accordance with an exemplary embodiment;
FIG. 14 is a block diagram of a generating device illustrating a task flow according to an exemplary embodiment;
FIG. 15 is a block diagram of a processing device illustrating a task flow according to an exemplary embodiment;
fig. 16 is a block diagram of an electronic device 200 of a generating apparatus of a task flow shown according to an example embodiment.
Detailed Description
In order to make the technical solutions of the present disclosure better understood by those of ordinary skill in the art, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the disclosure described herein are capable of operation in sequences other than those illustrated or otherwise described herein. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.
In practical application scenarios, for example, in overseas business scenarios, overseas orders must be audited by a special department before financial approval, but the requirement does not exist when the flow transfer template is configured, and the original flow transfer template needs to be modified, that is, all the related flows need to be adjusted currently, so that the influence range is wide, and the business development is seriously influenced.
In order to solve the above problem, the present disclosure provides a method for generating a task flow, where a first task flow generation request is received, where the first task flow generation request includes one or more task nodes and a flow relationship between the task nodes; constructing a task flow tree based on the circulation relationship among the task nodes; the task flow tree comprises each task node; for any task node, one or more tasks of any task node and the flow relationship among the tasks are obtained, a task aggregation flow tree of any task node is constructed based on the flow relationship among the tasks, and any task node and the task aggregation flow tree are associated. Therefore, by establishing the task aggregation process tree corresponding to each task node, the task aggregation nodes and/or the operation nodes in the task aggregation process tree can be updated, so that the operation nodes can be flexibly updated, and the flexibility of the approval operation is improved.
Fig. 2 is a flowchart illustrating a task flow generation method according to an exemplary embodiment, and is applied to an electronic device, such as a computer terminal, a mobile terminal, a server, and the like. As shown in fig. 2, the following steps 101-103 are included.
Step 101, receiving a first task process generation request, where the first task process generation request includes one or more task nodes and a flow relationship between the task nodes.
In the embodiment of the present disclosure, a corresponding task flow generation request may be generated according to a specific service scenario requirement, specifically, according to a specific service requirement, one or more task nodes and a flow relationship between each task node are determined, for example, according to service a, the task nodes a1, a2, and a3 are determined, and the flow relationship between a1, a2, and a3 is determined to be a1 → a2 → a3, that is, the task flow generation request includes one or more task nodes and a flow relationship between each task node.
102, constructing a task flow tree based on the circulation relationship among task nodes; the task flow tree comprises task nodes.
In the embodiment of the disclosure, the task flow tree is constructed based on the circulation relationship among the task nodes. The flow relationship among the task nodes comprises the following steps: and if the current task node is finished, jumping to the next task node, or if the current task node is returned, returning to the previous task node or jumping to the initiator of the approval request.
In the embodiment of the present disclosure, the task node is mainly used for controlling the flow of the process, and is not an actual processing task.
Step 102, for any task node, acquiring one or more tasks of any task node and a flow relationship between the tasks, and constructing a task aggregation flow tree of any task node based on the flow relationship between the tasks, and associating any task node and the task aggregation flow tree.
In the embodiment of the disclosure, a corresponding task aggregation flow tree is created for each task node according to the requirements of a service scenario. The task aggregation flow tree is a task execution tree with multiple layers, wherein the task aggregation flow tree comprises a task aggregation node layer and a task operation node layer, the task aggregation node layer comprises task aggregation nodes corresponding to the tasks, the flow relationship among the task aggregation nodes corresponds to the flow relationship among the tasks, and the task operation node layer comprises one or more operation nodes corresponding to the tasks; and the operation node and the task aggregation node corresponding to any task are associated.
In the embodiment of the present disclosure, the operation node corresponding to any task is configured to receive the operation instruction and transmit the operation result to the task aggregation node corresponding to any task, and the task aggregation node corresponding to any task is configured to determine the state of any task based on the operation result and transmit the state of any task to the associated task node.
In the embodiment of the present disclosure, a task aggregation flow tree of any task node is constructed based on a flow relationship between tasks, including: creating task aggregation nodes corresponding to the tasks, and creating a circulation relation between the task aggregation nodes corresponding to the tasks based on the circulation relation between the tasks; and for any task, creating an operation node corresponding to any task, associating a task aggregation node corresponding to any task and an operation node corresponding to any task, and constructing a task aggregation flow tree of any task node. In one embodiment, associating any task node with a task aggregation flow tree includes: and associating any task node with the task aggregation node corresponding to each task.
In the embodiment of the present disclosure, there are many ways for generating the task aggregation node. For example, a task aggregation node is created on the flow template and associated with a task node on the flow template. For another example, a new configuration rule is received, a task aggregation node is added according to the configuration rule, for example, the configuration rule is that a user 1 needs to examine and approve before the financial general supervision is approved, the configuration rule is obtained when a process flow template is generated, according to the configuration rule corresponding to the service, a task aggregation node is added before the task aggregation node of the financial general supervision and approval node, the task aggregation node is associated with a user operation node, and the user operation node is used for the user 1 to examine and approve or operate. For example, the task aggregation node which is actively added by the user is at least used for adding a task operation node, for example, when a first-level department examines and approves a contract, the user 2 does not know the inside of the contract and needs the opinion of other people, so that a task aggregation node can be dynamically created before the task aggregation node which examines and approves the contract, the task aggregation node is associated with an opinion obtaining operation node, and the opinion obtaining operation node is used for obtaining the opinion of other people.
For example, fig. 3 is an exemplary diagram illustrating generation of a task flow according to an exemplary embodiment, and as shown in fig. 3, a task node is generated for each user task, and a driving relationship before and after is established according to a task flow relationship, which is directly a leading approval task → a department leading approval task → a financial approval task. The task circulation process comprises the following steps: if the directly-affiliated leader approval task is completed, jumping to a department leader approval task; if the department leads the approval task to be completed, jumping to the financial approval task; if the direct leader approval task is returned, jumping to a task request initiator; if the department leader approval task is returned, returning to the direct leader approval task or jumping to a task request initiator; and if the financial examination and approval task is returned, returning to a department leader examination and approval task or jumping to a task request initiator.
Specifically, according to the requirements of the business scenario, a corresponding task aggregation flow tree is created for each task node, and continuing to take the task node shown in fig. 3 as an example, fig. 4 is an exemplary diagram illustrating generation of a task flow according to an exemplary embodiment, as shown in fig. 4, where a first layer (level0) includes the task aggregation node and a flow relationship between the task aggregation nodes.
In one embodiment, for each task node, a task aggregation node corresponding to each task is created according to one or more tasks of the task node, wherein a flow relationship between the task aggregation nodes is consistent with a flow relationship between the corresponding tasks. For example, in fig. 4, it is assumed that the task node "department leader approval task" includes seven tasks: tasks 1-7, the flow relationship is: task 1 → task 2 → task 3 → task 4 → task 5 → task 6 → task 7, then a task aggregation node 1-7 is created for the seven tasks, wherein the task aggregation node 1 corresponds to task 1, the task aggregation node 2 corresponds to task 2, the task aggregation node 3 corresponds to task 3, the task aggregation node 4 corresponds to task 4, the task aggregation node 5 corresponds to task 5, the task aggregation node 6 corresponds to task 6, and the task aggregation node 7 corresponds to task 7, and the flow relationship of the seven task aggregation nodes is as follows: task aggregation node 1 → task aggregation node 2 → task aggregation node 3 → task aggregation node 4 → task aggregation node 5 → task aggregation node 6 → task aggregation node 7.
In another embodiment, tasks may be dynamically added at a task node based on actual demand. For example, in fig. 4, it is assumed that a task node "department leader approval task" includes 1 task, and the task corresponds to the task aggregation node 4, in practical application, it is necessary to add service tasks such as pre-tagging, post-tagging, inquiry and the like on the basis of the above tasks, so that it is necessary to create additional task aggregation nodes, such as the task aggregation node 1, the task aggregation node 2, the task aggregation node 3, the task aggregation node 5, the task aggregation node 6, the task aggregation node 7 and the like, which are dynamically created according to configuration rules of services such as pre-tagging, post-tagging, inquiry and the like.
It should be noted that, in fig. 4, the task node of the department lead approval task is taken as an example for description, the direct lead approval task may also include a task aggregation process tree formed by one or more equal task aggregation nodes, and the financial approval task may also include a task aggregation process tree formed by one or more equal task aggregation nodes, and the selection setting is specifically performed according to business application needs.
In the embodiment of the present disclosure, as shown in fig. 4, taking "department leader task node" as an example, the task aggregation node is not used for actual process approval, and is used as state management and control, and specific process approval may be executed by the operation node associated with each task aggregation node. In some embodiments, fig. 5 is an exemplary diagram illustrating generation of a task flow according to an exemplary embodiment, and as shown in fig. 5, under each task aggregation node, an operation node is created according to configuration information of a task corresponding to a current task aggregation node, and the operation node participates in an actual approval work.
As shown in fig. 5, the number of operation nodes may be selectively set according to a service scenario, for example, according to configuration information of a task corresponding to the task aggregation node 1, an operation node 1-1 and an operation node 1-2 are created, which is up to the operation node 1-N; for example, according to the configuration information of the task corresponding to the task aggregation node 3, an operation node 3-1 and an operation node 3-2 are created until the operation node 3-N; the operation node 5-1 is also created, for example, based on configuration information of a task corresponding to the task aggregation node 5. For example, assuming that the configuration information of the task 1 is approval by the user 1-1 → approval by the user 1-2 → approval by the user 1-3, an operation node 1-1, an operation node 1-2, and an operation node 1-3 are created for the task 1, where the flow relationship of the operation nodes is: operation node 1-1 → operation node 1-2 → operation node 1-3, and associates the operation node and task aggregation node 1.
The final operation result of the operation node is transmitted to the task aggregation node, and to achieve this, the operation node located at the last position in the flow may be associated with the task aggregation node. For example, assume that the flow relationship of the operation node is: the operation node 1-1 → the operation node 1-2 → the operation node 1-3, and the operation node 1-3 and the task aggregation node may be associated.
It should be noted that the operation nodes under different task aggregation nodes have no direct relationship, and the operation nodes under the same task aggregation node may affect each other according to the configuration information of the task corresponding to the task aggregation node.
Therefore, the embodiment of the disclosure realizes dynamically increasing the services of pre-signing, post-signing, inquiry and pending approval on the basis of not modifying the existing flow transfer template, and the newly added node also supports the continuous increase of the service requirements of pre-signing, post-signing, inquiry, pending approval and the like, thereby reducing the development, operation and maintenance work, rapidly supporting the service appeal, improving the stability of the system, and not needing to frequently release the flow transfer template.
In this embodiment of the present disclosure, after a task node is started, for example, a first task aggregation node is found through a relationship of level0 in fig. 3, and a task aggregation node of front node information and an operation node associated with the task aggregation node are created for the first task aggregation node, where actions that a user may execute include: examination and approval pass, rejection, solicitation, and active pre-tagging, wherein the solicitation and active pre-tagging may be understood as dynamically adding a task aggregation node and/or an operation node in a task aggregation flow tree, and the purpose of solicitation and active pre-tagging is achieved by adding the task aggregation node and/or the operation node, which is specifically described in the embodiment of fig. 8 and will not be described in detail herein.
Therefore, in the embodiment of the present disclosure, each task aggregation node in the flow template may dynamically add a task aggregation node or an operation node to form or update a task aggregation flow board due to the configuration rule and the active signing of the user, or due to the matching of a newly added user to the rule, and the like. For example, the aggregation node of the user approval 1 corresponding to the user approval 1 already exists, the rule matched by the newly added user is that the user approval 2 is transferred to the user approval 1 to perform operation only after passing the operation, and at this time, the task aggregation flow tree needs to be updated: and adding a user approval 2 aggregation node and a user approval 2 operation node before the user approval 1 aggregation node, and associating the user approval 2 aggregation node and the user approval 2 operation node. For another example, if a task 2 is added before a task 1 in the configuration rule, a task aggregation node 2 for the task 2 is dynamically created, and the task aggregation node 2 is set before the task aggregation node 1 for the task 1. For example, if the user approval 1 is added before the user approval 2 in the configuration rule, the approval operation node 1 corresponding to the user approval 1 is dynamically created, and the approval operation node 1 is set before the approval operation node 2 corresponding to the user approval 2.
According to the task flow generation method in the embodiment of the disclosure, a first task flow generation request is received, wherein the first task flow generation request comprises one or more task nodes and a circulation relation between the task nodes; constructing a task flow tree based on the circulation relationship among the task nodes; the task flow tree comprises each task node; for any task node, one or more tasks of any task node and the flow relationship among the tasks are obtained, a task aggregation flow tree of any task node is constructed based on the flow relationship among the tasks, and any task node and the task aggregation flow tree are associated. Therefore, the task aggregation process tree corresponding to each task node is established, flexible updating of the operation nodes can be achieved by updating the task aggregation nodes and/or the operation nodes in the task aggregation process tree, the problem that the operation nodes in the existing task process are fixed and cannot meet the requirement of updating the operation node scene is solved, and flexibility of approval operation is improved.
FIG. 6 is a flow chart illustrating another task flow generation method according to an exemplary embodiment, as shown in FIG. 6, after step 102, including the following steps 201 and 202.
Step 201, receiving a second task flow generation request, where the second task flow generation request includes a target operation node, one or more operation tasks of the target operation node, and a flow relationship between the operation tasks.
Step 202, based on the flow relationship among the operation tasks, an operation task aggregation flow tree of the target operation node is constructed, and the target operation node and the operation task aggregation flow tree are associated.
In one embodiment, a related operation task aggregation flow tree can be constructed on the basis of the existing operation nodes according to business needs, and an infinite iteration task aggregation flow tree is formed.
In the embodiment of the present disclosure, the operation task aggregation flow tree includes an operation task aggregation node layer and an operation task operation node layer, the operation task aggregation node layer includes operation task aggregation nodes corresponding to the operation tasks, respectively, and a flow relationship between the operation task aggregation nodes corresponds to a flow relationship between the operation tasks, and the operation task operation node layer includes one or more operation nodes corresponding to the operation tasks, respectively; and the operation nodes corresponding to any operation task are associated with the operation task aggregation node.
Fig. 7 is an exemplary diagram illustrating generation of a task flow according to an exemplary embodiment, where as shown in fig. 7, an operation node 1-1, an operation node 1-2, and up to the operation node 1-N are created according to configuration information of a task corresponding to a task aggregation node 1, and assuming that the operation node 1-N includes a plurality of operation tasks 21-25, a task aggregation node 21 (corresponding to the operation task 21), a task aggregation node 22 (corresponding to the operation task 22), a task aggregation node 23 (corresponding to the operation task 23), a task aggregation node 24 (corresponding to the operation task 24), and a task aggregation node 25 (corresponding to the operation task 25) are correspondingly created for the operation tasks 21-25.
In practical application, according to configuration information of an operation task corresponding to the task aggregation node 21, an operation node 21-1 and an operation node 21-2 are created until the operation node 21-N; and creating an operation node 22-1 and an operation node 22-2 according to the operation task corresponding to the task aggregation node 22, and the like until the operation node 22-N.
Therefore, the setting is selected according to the business application requirements, the process nodes or the operation nodes can be dynamically added to each task aggregation node and each operation node, the requirements of more business scenes are met, and the flexibility of examination and approval is improved.
FIG. 8 is a flowchart illustrating a method of generating yet another task flow according to an exemplary embodiment. As shown in fig. 8, the following steps 301-303 are included.
Step 301, receiving a task flow update request, where the task flow update request includes a target task node.
Step 302, obtaining an update task of a target task node.
And step 303, updating the task aggregation flow tree according to the update task.
In the embodiment of the present disclosure, the task aggregation flow tree is updated according to a specific application scenario, for example, the task aggregation nodes and the operation nodes are added, deleted, and changed.
In the embodiment of the disclosure, the target task node has an associated task aggregation flow tree, the task aggregation flow tree includes a task aggregation node layer and a task operation node layer, the task aggregation node layer includes task aggregation nodes corresponding to the tasks, respectively, a flow relationship between the task aggregation nodes corresponds to a flow relationship between the tasks, and the task operation node layer includes one or more operation nodes corresponding to the tasks, respectively; and the operation node and the task aggregation node corresponding to any task are associated.
In the embodiment of the present disclosure, there are various ways to update the task aggregation flow tree according to the update task, which are described as follows.
The first example is that an update task aggregation node, an update operation node, an associated update task aggregation node and an update operation node corresponding to an update task are created, the update task aggregation node is inserted according to the position of the update task aggregation node in a task aggregation flow tree, and the update task aggregation node and the task aggregation node before and after the update task aggregation node are associated, or the update task aggregation node and the task aggregation node before the update task aggregation node are associated, or the update task aggregation node and the operation node after the update task aggregation node are associated.
For example, continuing to describe with fig. 5 as an example, the target task node is an update task of a task node, which is a "department leader approval task", and the update task aggregation node is a task aggregation node 0, the update operation nodes are operation nodes 0-1 and 0-2, the task aggregation node 0 and the update operation nodes are operation nodes 0-1 and 0-2, the task aggregation node 0 is inserted in front of the task aggregation node 1 according to a position (for example, a first position) of the update task aggregation node (i.e., the task aggregation node 0) in the task aggregation flow tree, and the task aggregation node 0 is associated with the task aggregation node 1; or the position of the task aggregation node 0 in the task aggregation flow tree is, for example, the third position, the task aggregation node 0 is inserted in front of the task aggregation node 3, and the task aggregation node 0 is associated with the task aggregation node 2 and the task aggregation node 3; or the position of the task aggregation node 0 in the task aggregation flow tree is, for example, the last position, the task aggregation node 0 is inserted behind the task aggregation node 7, and the task aggregation node 0 and the task aggregation node 7 are associated with each other.
In a second example, an update operation node corresponding to the update task is created, the update operation node is inserted according to the position of the update operation node in the update task aggregation flow tree, and the update operation node and operation nodes before and after the update operation node are associated, or the update operation node and operation nodes before the update operation node are associated, or the update operation node and operation nodes after the update operation node are associated.
For example, continuing to describe with fig. 5 as an example, the target task node is an update task of a task node, which is a "department leader approval task", the update operation node corresponding to the update task is an operation node 0-0, the operation node 0-0 is inserted in front of the operation node 1-1 according to a position of the update operation node in the update task aggregation flow tree, for example, the position of the operation node 0-0 is a first position under the task aggregation node 1, and the operation node 0-0 is associated with the operation node 1-1; or the position of the operation node 0-0 in the task aggregation flow tree is the third position under the task aggregation node 1, the operation node 0-0 is inserted in front of the operation node 1-3, and the operation node is associated with the operation node 1-2 and the operation node 1-3; or the position of the operation node 0-0 in the task aggregation flow tree is the last position under the task aggregation node 1, the operation node 0-0 is inserted behind the operation node 1-N, and the operation node 0-0 is associated with the operation node 1-N.
In a third example, a task aggregation node to be deleted and/or an operation node to be deleted corresponding to the update task are deleted, and a task aggregation node before and after the task aggregation node to be deleted and/or a front and back operation node after the operation node to be deleted are associated according to the position of the task aggregation node to be deleted and/or the operation node to be deleted in the task aggregation flow tree.
For example, continuing to describe with fig. 5 as an example, the target task node is an update task of a task node, which is a "department leader approval task", for example, the task aggregation node to be deleted is a task aggregation node 1, the task aggregation node 1 is located at a first position in the task aggregation flow tree, and the task aggregation node 1 and the corresponding operation nodes 1-1 to 1-N are deleted; for example, the task aggregation node to be deleted is the task aggregation node 3, the position of the task aggregation node 3 in the task aggregation flow tree is the third position, and after the task aggregation node 3 and the corresponding operation nodes 3-1 to 3-N are deleted, the task aggregation node 2 and the task aggregation node 4 are associated; for example, the task aggregation node to be deleted is the task aggregation node 7, the position of the task aggregation node 7 in the task aggregation flow tree is the last position, and the task aggregation node 7 and the corresponding operation nodes 7-1 to 7-N are deleted.
For example, if the update task corresponds to the operation node 3-1 to be deleted in the task aggregation node 3, the position of the operation node 3-1 to be deleted in the task aggregation flow tree is the first position, and the operation node 3-1 to be deleted is deleted; for example, the update task corresponds to an operation node 3-2 to be deleted in the task aggregation node 3, the position of the operation node 3-2 to be deleted in the task aggregation flow tree is a second position, the operation node 3-2 to be deleted is deleted, and the operation node 3-1 and the operation node 3-3 are associated; for example, the update task corresponds to the operation node 3-N to be deleted in the task aggregation node 3, the position of the operation node 3-N to be deleted in the task aggregation flow tree is the last position, and the operation node 3-N to be deleted is deleted.
And in the fourth example, determining a task aggregation node to be changed and/or an operation node to be changed corresponding to the update task and change association information, and changing the association relationship of the task aggregation node to be changed and/or the operation node to be changed in the task aggregation flow tree according to the change association information.
For example, continuing to describe with fig. 5 as an example, if the target task node is an update task of a task node, such as a task aggregation node to be changed corresponding to the update task is a task aggregation node 1, and the change association information is behind the task aggregation node 4 and in front of the task aggregation node 5, the association relationship between the task aggregation node 1 and the task aggregation node 2 is deleted, and the task aggregation node 1 is associated behind the task aggregation node 4 and in front of the task aggregation node 5, that is, the task aggregation node 1 is disposed between the task aggregation nodes 4 and 5 and is associated with the task aggregation nodes 4 and 5; for example, updating a task aggregation node 4 corresponding to the task, changing the association information to that the task aggregation node 4 is in front of the task aggregation node 1, deleting the association relationship between the task aggregation node 4 and the task aggregation node 3 as well as the task aggregation node 5, arranging the task aggregation node 4 in front of the task aggregation node 1 and associating with the task aggregation node 1, and associating the task aggregation node 3 with the task aggregation node 5; for example, if the operation node to be changed corresponding to the update task is the operation node 1-1, and the change association information is behind the operation node 1-4 and in front of the operation node 1-5, the association relationship between the operation node 1-1 and the operation node 1-2 is deleted, and the operation node 1-1 is associated behind the operation node 1-4 and in front of the operation node 1-5, that is, the operation node 1-1 is arranged between the operation nodes 1-4 and 1-5 and is associated with the operation nodes 1-4 and 1-5; for example, the operation node 2-4 corresponding to the task is updated, the association information is changed to be that the operation node 2-4 is in front of the operation node 2-1, the association relation between the operation node 2-4 and the operation nodes 2-3 and 2-5 is deleted, the operation node 2-4 is arranged in front of the task operation node 2-1 and is associated with the front of the task operation node 2-1, and the operation node 2-3 is associated with the operation node 2-5.
According to the task flow generation method, the task flow updating request is received and comprises the target task node, the updating task of the target task node is obtained, and the task aggregation flow tree is updated according to the updating task. By adding and deleting task aggregation nodes and/or operation nodes and changing the incidence relation of the task aggregation nodes and/or operation nodes and other different updating tasks, the task aggregation flow tree is updated, the operation nodes are flexibly added, and the flexibility of approval operation is improved.
FIG. 9 is a flowchart illustrating a method of processing a task flow in accordance with an exemplary embodiment. As shown in fig. 9, the following steps 401-403 are included.
Step 401, an operation node corresponding to the current task receives an operation instruction.
Step 402, transmitting an operation result corresponding to the operation instruction to a current task aggregation node corresponding to the current task.
And 403, determining the task state of the current task according to the task setting information and the operation result of the task corresponding to the current task aggregation node.
And step 404, when the task state of the current task is passing, jumping to a task aggregation node of a next task according to the circulation relationship among the task aggregation nodes, and when the task state of each task aggregation node is passing, jumping to the next task node according to the circulation relationship among the task nodes.
In the embodiment of the disclosure, the task flow tree includes one or more task nodes and a task aggregation flow tree associated with each task node, the task aggregation flow tree includes task nodes and task aggregation flow trees associated with the task nodes, the task aggregation flow tree includes a task aggregation node layer and a task operation node layer, the task aggregation node layer includes task aggregation nodes corresponding to the tasks, respectively, a flow relationship between the task aggregation nodes corresponds to a flow relationship between the tasks, and the task operation node layer includes one or more operation nodes corresponding to the tasks, respectively; and associating the operation node and the task aggregation node corresponding to any task.
In the embodiment of the present disclosure, there are various ways to determine the task state of the current task according to the task setting information and the operation result of the current task aggregation node, which are described as follows.
In the first example, according to task setting information of a task corresponding to a current task aggregation node, it is determined that a task state of the current task is passed when operation results corresponding to all operation nodes associated with the current task aggregation node are passed; and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
For example, taking fig. 5 as an example, if the current task aggregation node is the task aggregation node 2, the operation node 2-1, the operation node 2-2 and all the operation nodes 2-N associated therewith are all passed, and when the operation results of all the operation nodes are passed and the task state of the current task is confirmed to be passed, the next task aggregation node, such as the task aggregation node 2, is skipped; and if the operation result of any one of the operation node 1-1, the operation node 1-2 and the operation node … … corresponding to the current task aggregation node is returned, for example, the operation node 1-1 is returned, and it is determined that the task state of the current task is failed, returning to the previous task aggregation node (for example, the task aggregation node 1) or jumping to the task processing request initiator.
In the second example, according to task setting information of a task corresponding to a current task aggregation node, it is determined that a task state of the current task is a passing state when an operation result corresponding to any operation node corresponding to the current task aggregation node is an operation passing state; and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
For example, taking fig. 5 as an example, if the current task aggregation node is the task aggregation node 1, the corresponding operation node 1-1 of the current task aggregation node, and any operation node in the operation nodes 1-2 and … … passes through, for example, the operation node 1-1 operates to pass through, and it is determined that the task state of the current task is pass, then the next task aggregation node, for example, the task aggregation node 2, is skipped; and if any operation node in the operation nodes 1-1, 1-2 and … … corresponding to the current task aggregation node returns, for example, the operation node 1-1 approves and returns, and the task state of the current task is determined to be failed, returning to the previous task aggregation node or jumping to a task processing request initiator.
In a third example, according to task setting information of a task corresponding to a current task aggregation node, determining that a task state of the current task is a passing state when an operation result corresponding to an operation node with a preset value corresponding to the current task aggregation node is an operation passing state; and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
For example, taking fig. 5 as an example, the preset value may be 1 to N, which is specifically set according to the needs of a service scenario, for example, the preset value is 2, if the current task aggregation node is a task aggregation node 1, and an operation node 1-1 corresponding to the current task aggregation node, an operation node 1-2, and an operation node 1-2 in … … operation nodes 1-N approve and pass, and it is determined that the task state of the current task is passed, then a subsequent task aggregation node, such as a task aggregation node 2, is skipped to; and if any operation node in the operation nodes 1-1, 1-2 and … …, such as the operation node 1-1, corresponding to the current task aggregation node returns to confirm that the task state of the current task is failed, returning to the previous task aggregation node or jumping to the task processing request initiator.
It can be understood that after the task aggregation process tree derived from a certain operation node is executed, the task state of the task aggregation node to which the operation node belongs is modified, and the task state is transmitted to the associated task node, and the task node drives the process to flow to the next task node when the task state is passed.
It should be noted that, when the task state of the current task is failed, the task flow is returned to the previous task aggregation node or jumps to the task processing request initiator.
In the embodiment of the disclosure, a plurality of task nodes are not created according to the number of users or roles on an operation node, but a task aggregation node is created for each task node, then the operation node is created according to one or more tasks of each task node, the task aggregation node and the operation node are associated, a task aggregation tree of the task node is generated, the task aggregation node and the task node are associated, the task aggregation node determines the node state (namely, the task state) of the task aggregation node according to the operation result of the operation node, the state is transmitted to the task node, and the task node drives task flow according to the state.
The task flow processing method of the embodiment of the present disclosure includes receiving an operation instruction through an operation node corresponding to a current task, transmitting an operation result corresponding to the operation instruction to a current task aggregation node corresponding to the current task, determining a task state of the current task according to task setting information and the operation result of a task corresponding to the current task aggregation node, jumping to a task aggregation node of a next task according to a flow relationship between the task aggregation nodes when the task state of the current task is passed, and jumping to the next task node according to the flow relationship between the task nodes when the task state of each task aggregation node is passed. Therefore, flexible updating of the operation nodes can be achieved by updating the task aggregation nodes and/or the operation nodes in the task aggregation process tree, so that task processing processes are dynamically increased, and flexibility of approval operation is improved.
The task flow processing method of the present disclosure may be applied to the scenario shown in fig. 10, where fig. 10 is an application scenario diagram of a task flow generating method shown according to an exemplary embodiment, and the application scenario may include a plurality of terminal devices 1-N, where a server 20 may be in communication connection with the terminal devices 1-N through a communication interface, for example, after a task processing request is initiated through the terminal device 1, the task processing request is submitted to a terminal device 2 through the server 20 for display, when the terminal device 2 operates based on an operation node corresponding to a current task, an operation result is transmitted to a current task aggregation node corresponding to the current task, a task state of the current task is determined according to task setting information and the operation result of the task corresponding to the current task aggregation node, and in a case that the task state of the current task is a pass state, jumping to a task aggregation node of a next task according to the circulation relationship among the task aggregation nodes, and jumping to the next task node according to the circulation relationship among the task nodes under the condition that the task state of each task aggregation node is passed; or the operation of the user operation node of the terminal device 2 is returned, that is, the operation is returned to the previous task aggregation node or the operation is skipped to the task processing request initiator under the condition that the task state of the current task is failed.
Taking overseas service as an example, after a user a initiates a task processing request through a terminal device 1, a user B operates a node through a terminal device 2 to pass through the operation, and triggers an update instruction. The updating process comprises the following steps: and creating an operation node in a task aggregation flow tree corresponding to the current task node, and associating the operation node with the task aggregation node of the current task. As shown in fig. 11a to 11b, fig. 11a to 11b are task flow interface diagrams of a terminal device according to an exemplary embodiment, where fig. 11a shows a task flow before a post-trigger-and-tag instruction, and fig. 11b shows a task flow after the post-trigger-and-tag instruction.
That is, after the terminal device 1 initiates the task processing request, the operation node of the terminal device 2 passes through the operation and triggers the post-tagging instruction, so that the operation node corresponding to the post-tagging can be newly added in the task flow interface diagram shown in fig. 11 b.
In the embodiment of the disclosure, the task nodes no longer play a role of process approval, but are used for controlling and driving the flow of the process, the task aggregation nodes are used for controlling the task state, the specific process approval can be executed by the operation nodes associated with each task aggregation node, and the operation nodes associated with different task aggregation nodes are not affected, so that any task aggregation node or operation node is added, modified and deleted, the state of other task aggregation nodes is not affected, and the task aggregation nodes correspond to the tasks, that is, the update operation on any task does not affect the execution of other tasks. Although the update of the operation node can affect the associated task aggregation node, the flow conversion relation between the task nodes is not affected, and the established task flow tree does not need to be changed. In addition, the task nodes in the embodiment of the present disclosure are used to control and drive the flow of the process, and the flow process depends on the state of the task aggregation node (that is, the state of the managed task), and as described above, the operation nodes associated with each task aggregation node do not affect each other, so that the embodiment of the present disclosure can flexibly add tasks and user operation nodes, and improve the flexibility of the approval operation.
FIG. 12 is a block diagram illustrating a means for generating a task flow according to an exemplary embodiment. Referring to fig. 12, the apparatus 500 includes: a first receiving unit 501, a first constructing unit 502, a first obtaining unit 503, a second constructing unit 504 and an associating unit 505.
The first receiving unit 501 is configured to receive a first task flow generation request, where the first task flow generation request includes one or more task nodes and a flow relationship between the task nodes.
A first constructing unit 502 configured to construct a task flow tree based on a flow relationship between task nodes; the task flow tree comprises task nodes.
The first obtaining unit 503 is configured to obtain, for any task node, one or more tasks of any task node and a flow relationship between the tasks.
A second constructing unit 504, configured to construct a task aggregation flow tree of any task node based on the flow relationship between tasks.
An associating unit 505 configured to associate any task node and the task aggregation flow tree.
The task aggregation flow tree comprises a task aggregation node layer and a task operation node layer, wherein the task aggregation node layer comprises task aggregation nodes corresponding to tasks, the flow relation among the task aggregation nodes corresponds to the flow relation among the tasks, and the task operation node layer comprises one or more operation nodes corresponding to the tasks; and the operation node and the task aggregation node corresponding to any task are associated.
In the embodiment of the present disclosure, the second constructing unit 504 is specifically configured to: creating task aggregation nodes corresponding to the tasks, and creating a circulation relation between the task aggregation nodes corresponding to the tasks based on the circulation relation between the tasks; for any task, creating an operation node corresponding to any task according to configuration information of the task corresponding to the task aggregation node corresponding to any task, associating the task aggregation node corresponding to any task and the operation node corresponding to any task, and constructing a task aggregation flow tree of any task node; associating any task node and the task aggregation flow tree, comprising: and associating any task node with the task aggregation node corresponding to each task.
In the embodiment of the present disclosure, as shown in fig. 13, the apparatus further includes, on the basis of fig. 12: a second receiving unit 506 and a third constructing unit 507.
A second receiving unit 506 configured to receive a second task flow generation request, where the second task flow generation request includes the target operation node, one or more operation tasks of the target operation node, and a flow relationship between the operation tasks.
The third constructing unit 507 is configured to construct an operation task aggregation flow tree of the target operation node, associate the target operation node and the operation task aggregation flow tree based on the flow relationship between the operation tasks.
The operation task aggregation flow tree comprises an operation task aggregation node layer and an operation task operation node layer, wherein the operation task aggregation node layer comprises operation task aggregation nodes corresponding to the operation tasks respectively, the circulation relationship among the operation task aggregation nodes corresponds to the circulation relationship among the operation tasks, and the operation task operation node layer comprises one or more operation nodes corresponding to the operation tasks respectively; and the operation nodes corresponding to any operation task are associated with the operation task aggregation node.
With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.
The task flow generation device of the embodiment of the disclosure receives a first task flow generation request, wherein the first task flow generation request comprises one or more task nodes and a circulation relationship among the task nodes; constructing a task flow tree based on the circulation relationship among the task nodes; the task flow tree comprises each task node; for any task node, one or more tasks of any task node and the flow relationship among the tasks are obtained, a task aggregation flow tree of any task node is constructed based on the flow relationship among the tasks, and any task node and the task aggregation flow tree are associated. By establishing the task aggregation process tree corresponding to each task node, flexible updating of the operation nodes can be achieved by updating the task aggregation nodes and/or the operation nodes in the task aggregation process tree, the problem that the operation nodes in the existing task process are fixed and cannot meet the requirement of updating the operation node scene is solved, and the flexibility of approval operation is improved.
FIG. 14 is a block diagram illustrating a means for generating a task flow according to an exemplary embodiment. Referring to fig. 14, the apparatus 600 includes: a third receiving unit 601, a second obtaining unit 602, and an updating unit 603.
The third receiving unit 602 is configured to receive a task flow update request, where the task flow update request includes a target task node.
The target task node is provided with an associated task aggregation flow tree, the task aggregation flow tree comprises a task aggregation node layer and a task operation node layer, the task aggregation node layer comprises task aggregation nodes corresponding to the tasks, the circulation relationship among the task aggregation nodes corresponds to the circulation relationship among the tasks, and the task operation node layer comprises one or more operation nodes corresponding to the tasks; and the operation node and the task aggregation node corresponding to any task are associated.
A second obtaining unit 602 configured to obtain an update task of the target task node.
An updating unit 603 configured to update the task aggregation flow tree according to the update task.
In this embodiment of the present disclosure, the updating unit 603 is specifically configured to: creating an update task aggregation node and an update operation node corresponding to the update task, and associating the update task aggregation node and the update operation node; inserting an update task aggregation node according to the position of the update task aggregation node in the task aggregation flow tree, and associating the update task aggregation node with task aggregation nodes before and after the update task aggregation node, or associating the update task aggregation node with the task aggregation node before the update task aggregation node, or associating the update task aggregation node with operation nodes after the update task aggregation node;
or
Creating an updating operation node corresponding to the updating task;
and inserting the update operation node according to the position of the update operation node in the task aggregation flow tree, and associating the update operation node with operation nodes before and after the update operation node, or associating the update operation node with the operation nodes before the update operation node, or associating the update operation node with the operation nodes after the update operation node.
In this embodiment of the present disclosure, the updating unit 603 is specifically configured to: deleting the task aggregation node to be deleted and/or the operation node to be deleted corresponding to the update task; and associating the task aggregation nodes before and after the task aggregation node to be deleted and/or associating the operation nodes before and after the operation node to be deleted according to the positions of the task aggregation node to be deleted and/or the operation node to be deleted in the task aggregation flow tree.
In this embodiment of the present disclosure, the updating unit 603 is specifically configured to: determining a task aggregation node to be changed and/or an operation node to be changed corresponding to the update task and change associated information; and in the task aggregation flow tree, the association relation of the task aggregation node to be changed and/or the operation node to be changed is changed according to the change association information.
With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.
The task flow generation device of the embodiment of the present disclosure obtains the update task of the target task node by receiving the task flow update request including the target task node, and updates the task aggregation flow tree according to the update task. The task aggregation process tree is updated by adding and deleting the task aggregation nodes and/or the operation nodes and changing the incidence relation of the task aggregation nodes and/or the operation nodes and other different updating tasks, so that the operation nodes are flexibly added, and the flexibility of the examination and approval operation is improved.
FIG. 15 is a block diagram of a processing device illustrating a task flow according to an exemplary embodiment. Referring to fig. 15, the apparatus 700 includes: a fourth receiving unit 701, a transmitting unit 702, a determining unit 703 and a jumping unit 704.
The fourth receiving unit 701 is configured to receive an operation instruction by an operation node corresponding to the current task.
A transmitting unit 702, configured to transmit an operation result corresponding to the operation instruction to a current task aggregation node corresponding to the current task.
The determining unit 703 is configured to determine a task state of the current task according to the task setting information and the operation result of the task corresponding to the current task aggregation node.
A jumping unit 704 configured to jump to a task aggregation node of a next task according to a flow relationship between the task aggregation nodes if the task state of the current task is pass, and jump to the next task node according to the flow relationship between the task nodes if the task state of each task aggregation node is pass.
In this embodiment of the present disclosure, the determining unit 703 is specifically configured to: determining that the task state of the current task is passing under the condition that operation results corresponding to all operation nodes associated with the current task aggregation node are passing according to task setting information of the task corresponding to the current task aggregation node; and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
In this embodiment of the present disclosure, the determining unit 703 is specifically configured to: according to task setting information of a task corresponding to a current task aggregation node, determining that the task state of the current task is passing under the condition that an operation result corresponding to any operation node corresponding to the current task aggregation node is passing; and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
In this embodiment of the present disclosure, the determining unit 703 is specifically configured to: according to task setting information of a task corresponding to a current task aggregation node, determining that the task state of the current task is passed under the condition that an operation result corresponding to an operation node with a preset numerical value corresponding to the current task aggregation node is passed; and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
In this disclosure, the apparatus further includes a returning unit configured to return to a previous task aggregation node or jump to a task processing request initiator when the task state of the current task is failed.
With regard to the apparatus in the above-described embodiment, the specific manner in which each module performs the operation has been described in detail in the embodiment related to the method, and will not be elaborated here.
The processing device of the task flow according to the embodiment of the present disclosure receives an operation instruction through an operation node corresponding to a current task, transmits an operation result corresponding to the operation instruction to a current task aggregation node corresponding to the current task, determines a task state of the current task according to task setting information and the operation result of a task corresponding to the current task aggregation node, jumps to a task aggregation node of a next task according to a flow relationship between the task aggregation nodes when the task state of the current task is passed, and jumps to the next task node according to the flow relationship between the task aggregation nodes when the task state of each task aggregation node is passed. Therefore, flexible updating of the operation nodes can be achieved by updating the task aggregation nodes and/or the operation nodes in the task aggregation process tree, so that task processing processes are dynamically increased, and flexibility of approval operation is improved.
Fig. 16 is a block diagram of an electronic device 200 of a generating apparatus of a task flow shown according to an example embodiment.
As shown in fig. 16, the electronic device 200 includes:
a memory 210 and a processor 220, a bus 230 connecting different components (including the memory 210 and the processor 220), wherein the memory 210 stores a computer program, and when the processor 220 executes the program, the method for generating the task flow according to the embodiment of the disclosure is implemented.
Bus 230 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. By way of example, such architectures include, but are not limited to, Industry Standard Architecture (ISA) bus, micro-channel architecture (MAC) bus, enhanced ISA bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.
Electronic device 200 typically includes a variety of electronic device readable media. Such media may be any available media that is accessible by electronic device 200 and includes both volatile and nonvolatile media, removable and non-removable media.
Memory 210 may also include computer system readable media in the form of volatile memory, such as Random Access Memory (RAM)240 and/or cache memory 250. The electronic device 200 may further include other removable/non-removable, volatile/nonvolatile computer system storage media. By way of example only, storage system 260 may be used to read from and write to non-removable, nonvolatile magnetic media (not shown in FIG. 16, commonly referred to as a "hard drive"). Although not shown in FIG. 16, a magnetic disk drive for reading from and writing to a removable, nonvolatile magnetic disk (e.g., a "floppy disk") and an optical disk drive for reading from or writing to a removable, nonvolatile optical disk (e.g., a CD-ROM, DVD-ROM, or other optical media) may be provided. In these cases, each drive may be connected to bus 230 by one or more data media interfaces. Memory 210 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of embodiments of the disclosure.
A program/utility 280 having a set (at least one) of program modules 270, including but not limited to an operating system, one or more application programs, other program modules, and program data, each of which or some combination thereof may comprise an implementation of a network environment, may be stored in, for example, the memory 210. The program modules 270 generally perform the functions and/or methodologies of the embodiments described in this disclosure.
Electronic device 200 may also communicate with one or more external devices 290 (e.g., keyboard, pointing device, display 291, etc.), with one or more devices that enable a user to interact with electronic device 200, and/or with any devices (e.g., network card, modem, etc.) that enable electronic device 200 to communicate with one or more other computing devices. Such communication may occur via input/output (I/O) interfaces 292. Also, the electronic device 200 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the Internet) via the network adapter 293. As shown in FIG. 16, the network adapter 293 communicates with the other modules of the electronic device 200 via the bus 230. It should be appreciated that although not shown in FIG. 16, other hardware and/or software modules may be used in conjunction with electronic device 200, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
The processor 220 executes various functional applications and data processing by executing programs stored in the memory 210.
It should be noted that, for the implementation process and the technical principle of the electronic device of the embodiment, reference is made to the foregoing explanation of the method for generating the task flow in the embodiment of the present disclosure, and details are not described here again.
The electronic device provided by the embodiment of the present disclosure may execute the method for generating and processing the task flow as described above, and receive a first task flow generation request, where the first task flow generation request includes one or more task nodes and a flow relationship between the task nodes; constructing a task flow tree based on the circulation relationship among the task nodes; the task flow tree comprises each task node; for any task node, one or more tasks of any task node and the flow relationship among the tasks are obtained, a task aggregation flow tree of any task node is constructed based on the flow relationship among the tasks, and any task node and the task aggregation flow tree are associated. Therefore, by establishing the task aggregation process tree corresponding to each task node, flexible updating of the operation nodes can be achieved by updating the task aggregation nodes and/or the operation nodes in the task aggregation process tree, the problem that the operation nodes in the existing task process are fixed and cannot meet the requirement of updating the operation node scene is solved, and the flexibility of approval operation is improved.
In order to implement the above embodiments, the present disclosure also provides a storage medium.
Wherein the instructions in the storage medium, when executed by the processor of the electronic device, enable the electronic device to perform the method for generating and processing the task flow as described above.
In order to implement the above embodiments, the present disclosure also provides a computer program product, which, when executed by a processor of an electronic device, enables the electronic device to perform the methods for generating and processing the task flow as described above.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This disclosure is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It will be understood that the present disclosure is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims (26)

1. A method for generating a task flow is characterized by comprising the following steps:
receiving a first task process generation request, wherein the first task process generation request comprises one or more task nodes and a circulation relationship among the task nodes;
constructing a task flow tree based on the circulation relationship among the task nodes; wherein the task flow tree comprises each task node;
for any task node, acquiring one or more tasks of the task node and a flow relation between the tasks, constructing a task aggregation flow tree of the task node based on the flow relation between the tasks, and associating the task node with the task aggregation flow tree;
the task aggregation flow tree comprises a task aggregation node layer and a task operation node layer, wherein the task aggregation node layer comprises task aggregation nodes corresponding to tasks, the flow relation among the task aggregation nodes corresponds to the flow relation among the tasks, and the task operation node layer comprises one or more operation nodes corresponding to the tasks; and the operation node and the task aggregation node corresponding to any task are associated.
2. The method according to claim 1, wherein the constructing a task aggregation flow tree of any task node based on a flow relationship between tasks comprises:
creating task aggregation nodes corresponding to the tasks, and creating a circulation relation between the task aggregation nodes corresponding to the tasks based on the circulation relation between the tasks; for any task, creating an operation node corresponding to the task according to configuration information of the task corresponding to the task aggregation node corresponding to the task, associating the task aggregation node corresponding to the task with the operation node corresponding to the task, and constructing a task aggregation flow tree of the task node;
the associating of the any task node and the task aggregation flow tree includes: and associating any task node with the task aggregation node corresponding to each task.
3. The method of claim 1, further comprising:
receiving a second task flow generation request, wherein the second task flow generation request comprises a target operation node, one or more operation tasks of the target operation node and a circulation relation among the operation tasks;
based on the circulation relationship among the operation tasks, constructing an operation task aggregation flow tree of the target operation node, and associating the target operation node and the operation task aggregation flow tree;
the operation task aggregation flow tree comprises an operation task aggregation node layer and an operation task operation node layer, wherein the operation task aggregation node layer comprises operation task aggregation nodes corresponding to the operation tasks respectively, the circulation relationship among the operation task aggregation nodes corresponds to the circulation relationship among the operation tasks, and the operation task operation node layer comprises one or more operation nodes corresponding to the operation tasks respectively; and the operation node corresponding to any operation task is associated with the operation task aggregation node.
4. A method for generating a task flow is characterized by comprising the following steps:
receiving a task flow updating request, wherein the task flow updating request comprises a target task node;
the target task node is provided with an associated task aggregation flow tree, the task aggregation flow tree comprises a task aggregation node layer and a task operation node layer, the task aggregation node layer comprises task aggregation nodes corresponding to the tasks, the circulation relationship among the task aggregation nodes corresponds to the circulation relationship among the tasks, and the task operation node layer comprises one or more operation nodes corresponding to the tasks; the operation node and the task aggregation node corresponding to any task are associated;
acquiring an update task of the target task node;
updating the task aggregation flow tree according to the updating task; wherein, the updating the task aggregation flow tree according to the update task includes:
creating an updating operation node corresponding to the updating task; or creating an update task aggregation node and an update operation node corresponding to the update task, and associating the update task aggregation node and the update operation node;
and updating the task aggregation flow tree according to the update operation node, or updating the task aggregation flow tree according to the update task aggregation node and the update operation node.
5. The method of claim 4, wherein updating the task aggregation flow tree according to the update task comprises:
creating an update task aggregation node and an update operation node corresponding to the update task, and associating the update task aggregation node and the update operation node;
inserting the update task aggregation node according to the position of the update task aggregation node in the task aggregation flow tree, and associating the update task aggregation node with task aggregation nodes before and after the update task aggregation node, or associating the update task aggregation node with task aggregation nodes before the update task aggregation node, or associating the update task aggregation node with operation nodes after the update task aggregation node;
or
Creating an updating operation node corresponding to the updating task;
and inserting the update operation node according to the position of the update operation node in the task aggregation flow tree, and associating the update operation node and operation nodes before and after the update operation node, or associating the update operation node and operation nodes before the update operation node, or associating the update operation node and operation nodes after the update operation node.
6. The method of claim 4, wherein updating the task aggregation flow tree according to the update task comprises:
deleting the task aggregation node to be deleted and/or the operation node to be deleted corresponding to the update task;
and associating the task aggregation nodes before and after the task aggregation node to be deleted and/or associating the operation nodes before and after the operation node to be deleted according to the positions of the task aggregation node to be deleted and/or the operation node to be deleted in the task aggregation flow tree.
7. The method of claim 4, wherein updating the task aggregation flow tree according to the update task comprises:
determining a task aggregation node to be changed and/or an operation node to be changed corresponding to the update task and change associated information;
and in the task aggregation flow tree, the association relation of the task aggregation node to be changed and/or the operation node to be changed is changed according to the change association information.
8. A method for processing a task flow is characterized by comprising the following steps:
receiving an operation instruction by an operation node corresponding to the current task;
transmitting an operation result corresponding to the operation instruction to a current task aggregation node corresponding to the current task;
determining the task state of the current task according to the task setting information of the task corresponding to the current task aggregation node and the operation result;
and when the task state of each task aggregation node is passed, jumping to the next task node according to the circulation relationship between the task nodes.
9. The method for processing the task flow according to claim 8, wherein the determining the task state of the current task according to the task setting information and the operation result of the task corresponding to the current task aggregation node includes:
according to the task setting information of the task corresponding to the current task aggregation node, determining that the task state of the current task is passed under the condition that operation results corresponding to all operation nodes associated with the current task aggregation node are passed;
and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
10. The method for processing the task flow according to claim 8, wherein the determining the task state of the current task according to the task setting information and the operation result of the task corresponding to the current task aggregation node includes:
determining that the task state of the current task is passing under the condition that an operation result corresponding to any operation node corresponding to the current task aggregation node is passing according to the task setting information of the task corresponding to the current task aggregation node;
and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
11. The method for processing the task flow according to claim 8, wherein the determining the task state of the current task according to the task setting information and the operation result of the task corresponding to the current task aggregation node includes:
determining that the task state of the current task is passing under the condition that an operation result corresponding to an operation node with a preset value corresponding to the current task aggregation node is passing according to task setting information of the task corresponding to the current task aggregation node;
and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
12. The method of processing a task flow of claim 8, further comprising:
and returning to the previous task aggregation node or jumping to a task processing request initiator under the condition that the task state of the current task is failed.
13. An apparatus for generating a task flow, comprising:
a first receiving unit configured to receive a first task flow generation request, where the first task flow generation request includes one or more task nodes and a flow relationship between the task nodes;
the first construction unit is configured to construct a task flow tree based on the circulation relationship among the task nodes; wherein the task flow tree comprises each task node;
the task management system comprises a first acquisition unit, a second acquisition unit and a processing unit, wherein the first acquisition unit is configured to acquire one or more tasks of any task node and a flow relationship among the tasks for the task node;
the second construction unit is configured to construct a task aggregation flow tree of any task node based on a flow relationship among tasks;
the association unit is configured to associate the any task node with the task aggregation flow tree;
the task aggregation flow tree comprises a task aggregation node layer and a task operation node layer, wherein the task aggregation node layer comprises task aggregation nodes corresponding to tasks, the flow relation among the task aggregation nodes corresponds to the flow relation among the tasks, and the task operation node layer comprises one or more operation nodes corresponding to the tasks; and the operation node and the task aggregation node corresponding to any task are associated.
14. The apparatus according to claim 13, characterized in that said second building unit is specifically configured to:
creating task aggregation nodes corresponding to the tasks, and creating a circulation relation between the task aggregation nodes corresponding to the tasks based on the circulation relation between the tasks; for any task, creating an operation node corresponding to the task according to configuration information of the task corresponding to the task aggregation node corresponding to the task, associating the task aggregation node corresponding to the task with the operation node corresponding to the task, and constructing a task aggregation flow tree of the task node;
the associating of the any task node and the task aggregation flow tree includes: and associating any task node with the task aggregation node corresponding to each task.
15. The apparatus of claim 13, further comprising:
a second receiving unit, configured to receive a second task flow generation request, where the second task flow generation request includes a target operation node, one or more operation tasks of the target operation node, and a flow relationship between the operation tasks;
a third construction unit, configured to construct an operation task aggregation flow tree of the target operation node based on the flow relationship among the operation tasks, and associate the target operation node and the operation task aggregation flow tree;
the operation task aggregation flow tree comprises an operation task aggregation node layer and an operation task operation node layer, wherein the operation task aggregation node layer comprises operation task aggregation nodes corresponding to the operation tasks respectively, the circulation relationship among the operation task aggregation nodes corresponds to the circulation relationship among the operation tasks, and the operation task operation node layer comprises one or more operation nodes corresponding to the operation tasks respectively; and the operation node corresponding to any operation task is associated with the operation task aggregation node.
16. An apparatus for generating a task flow, comprising:
a third receiving unit configured to receive a task flow update request, where the task flow update request includes a target task node;
the target task node is provided with an associated task aggregation flow tree, the task aggregation flow tree comprises a task aggregation node layer and a task operation node layer, the task aggregation node layer comprises task aggregation nodes corresponding to the tasks, the circulation relationship among the task aggregation nodes corresponds to the circulation relationship among the tasks, and the task operation node layer comprises one or more operation nodes corresponding to the tasks; the operation node and the task aggregation node corresponding to any task are associated;
a second obtaining unit configured to obtain an update task of the target task node;
the updating unit is configured to update the task aggregation flow tree according to the updating task;
wherein, the updating the task aggregation flow tree according to the update task includes:
creating an updating operation node corresponding to the updating task; or creating an update task aggregation node and an update operation node corresponding to the update task, and associating the update task aggregation node and the update operation node;
and updating the task aggregation flow tree according to the update operation node, or updating the task aggregation flow tree according to the update task aggregation node and the update operation node.
17. The apparatus according to claim 16, wherein the updating unit is specifically configured to:
creating an update task aggregation node and an update operation node corresponding to the update task, and associating the update task aggregation node and the update operation node;
inserting the update task aggregation node according to the position of the update task aggregation node in the task aggregation flow tree, and associating the update task aggregation node with task aggregation nodes before and after the update task aggregation node, or associating the update task aggregation node with task aggregation nodes before the update task aggregation node, or associating the update task aggregation node with operation nodes after the update task aggregation node;
or
Creating an updating operation node corresponding to the updating task;
and inserting the update operation node according to the position of the update operation node in the task aggregation flow tree, and associating the update operation node and operation nodes before and after the update operation node, or associating the update operation node and operation nodes before the update operation node, or associating the update operation node and operation nodes after the update operation node.
18. The apparatus according to claim 16, wherein the updating unit is specifically configured to:
deleting the task aggregation node to be deleted and/or the operation node to be deleted corresponding to the update task;
and associating the task aggregation nodes before and after the task aggregation node to be deleted and/or associating the operation nodes before and after the operation node to be deleted according to the positions of the task aggregation node to be deleted and/or the operation node to be deleted in the task aggregation flow tree.
19. The apparatus according to claim 16, wherein the updating unit is specifically configured to:
determining a task aggregation node to be changed and/or an operation node to be changed corresponding to the update task and change associated information;
and in the task aggregation flow tree, the association relation of the task aggregation node to be changed and/or the operation node to be changed is changed according to the change association information.
20. A task flow processing apparatus, comprising:
the fourth receiving unit is configured to receive the operation instruction by the operation node corresponding to the current task;
a transmission unit configured to transmit an operation result corresponding to the operation instruction to a current task aggregation node corresponding to the current task;
the determining unit is configured to determine the task state of the current task according to the task setting information of the task corresponding to the current task aggregation node and the operation result;
and the jumping unit is configured to jump to a task aggregation node of a next task according to the flow relationship among the task aggregation nodes when the task state of the current task is passed, and jump to the next task node according to the flow relationship among the task nodes when the task state of each task aggregation node is passed.
21. The processing apparatus of a task flow according to claim 20, wherein the determining unit is specifically configured to:
determining that the task state of the current task is passed under the condition that operation results corresponding to all operation nodes associated with the current task aggregation node are passed according to task setting information of the task corresponding to the current task aggregation node;
and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
22. The processing apparatus of a task flow according to claim 20, wherein the determining unit is specifically configured to:
determining according to task setting information of a task corresponding to the current task aggregation node, wherein the task state of the current task is passed under the condition that an operation result corresponding to any operation node corresponding to the current task aggregation node is passed;
and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
23. The processing apparatus of a task flow according to claim 20, wherein the determining unit is specifically configured to:
according to the task setting information of the task corresponding to the current task aggregation node, determining that the task state of the current task is passed under the condition that the operation result corresponding to the operation node with the preset value corresponding to the current task aggregation node is passed;
and under the condition that the operation result corresponding to any operation node corresponding to the current task aggregation node is operation return, the task state of the current task is failed.
24. The task flow processing device according to claim 20, further comprising:
and the returning unit is configured to return to the previous task aggregation node or jump to the task processing request initiator under the condition that the task state of the current task is failed.
25. An electronic device, comprising:
a processor;
a memory for storing the processor-executable instructions;
wherein the processor is configured to execute the instructions to implement the generation method of the task flow according to any one of claims 1 to 7 and the processing method of the task flow according to any one of claims 8 to 12.
26. A storage medium in which instructions, when executed by a processor of an electronic device, enable the electronic device to perform the method of generating the task flow recited in any one of claims 1 to 7 and the method of processing the task flow recited in any one of claims 8 to 12.
CN202011611307.7A 2020-12-30 2020-12-30 Method, device, equipment and storage medium for generating and processing task flow Active CN112766646B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011611307.7A CN112766646B (en) 2020-12-30 2020-12-30 Method, device, equipment and storage medium for generating and processing task flow

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011611307.7A CN112766646B (en) 2020-12-30 2020-12-30 Method, device, equipment and storage medium for generating and processing task flow

Publications (2)

Publication Number Publication Date
CN112766646A CN112766646A (en) 2021-05-07
CN112766646B true CN112766646B (en) 2022-04-29

Family

ID=75696020

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011611307.7A Active CN112766646B (en) 2020-12-30 2020-12-30 Method, device, equipment and storage medium for generating and processing task flow

Country Status (1)

Country Link
CN (1) CN112766646B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115454434A (en) * 2021-06-09 2022-12-09 华为技术有限公司 Control method and device based on combined fence, electronic equipment and server
CN113269538B (en) * 2021-06-23 2023-05-12 深圳平安智汇企业信息管理有限公司 Method, device, equipment and storage medium for forwarding parallel approval nodes
CN114157567A (en) * 2021-11-19 2022-03-08 浙江惠瀜网络科技有限公司 Routing engine configuration method and device, storage medium and electronic device
CN117557085B (en) * 2024-01-12 2024-04-19 中油物采信息技术有限公司 Workflow updating method and device and office platform

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7228328B2 (en) * 2001-05-31 2007-06-05 Hewlett-Packard Development Company, L.P. Multinode activation and termination method and system
CN101447040A (en) * 2008-10-17 2009-06-03 东软集团股份有限公司 Method for setting process instance restriction and device thereof as well as system for modifying process instance restrict
US10860384B2 (en) * 2012-02-03 2020-12-08 Microsoft Technology Licensing, Llc Managing partitions in a scalable environment
CN103677913B (en) * 2013-12-06 2017-07-25 华为技术有限公司 Method for processing business and device based on business process management
CN106126587A (en) * 2016-06-20 2016-11-16 上海赞越软件服务中心 Multinode data based on flow process display recording mechanism
CN110517018A (en) * 2019-08-26 2019-11-29 深圳前海环融联易信息科技服务有限公司 A kind of any jump method of node based on activiti workflow and device

Also Published As

Publication number Publication date
CN112766646A (en) 2021-05-07

Similar Documents

Publication Publication Date Title
CN112766646B (en) Method, device, equipment and storage medium for generating and processing task flow
CN109886693B (en) Consensus realization method, device, equipment and medium for block chain system
CN111610979B (en) API gateway subjected to persistence and coupling degree optimization and method thereof
US11398981B2 (en) Path creation method and device for network on chip and electronic apparatus
CN112559635B (en) Service processing method, device, equipment and medium for Ethernet alliance chain node
CN109508912B (en) Service scheduling method, device, equipment and storage medium
CN108762949A (en) Centralized dispatching method, system, computer equipment and storage medium
CN108733457A (en) The implementation method and device of distributed transaction
CN110502732A (en) A kind of rule generating method of discount coupon, device and server
CN113641591B (en) Test case generation method and device and test method and device
US20220272130A1 (en) Method and apparatus for matching users, computer device, and storage medium
CN109299913B (en) Employee salary scheme generation method and device
CN111144837A (en) Flow arrangement method and device, storage medium and electronic equipment
CN110233842B (en) Request verification method and related device
CN111522840B (en) Label configuration method, device, equipment and computer readable storage medium
CN112925584A (en) Scene-based file configuration method, device, storage medium, and program product
US11562421B2 (en) Management of revisions on revisions of orders
CN110096543A (en) Data manipulation method, device, server and the medium of application program
CN110070379A (en) A kind of method for message transmission, device and server
CN114844788A (en) Network data analysis method, system, device and storage medium
CN114489772A (en) Workflow execution method and device, storage medium and equipment
CN105812434A (en) Business chain control method and device after virtualization of user hand-held equipment
CN112396511A (en) Distributed wind control variable data processing method, device and system
CN112102058A (en) Management system parameter configuration method and device
CN108509553A (en) A kind of item file generation method and platform

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