Task process display method and device, equipment, medium and program product

Abstract

The invention discloses a task process display method and device, equipment, a medium and a program product, and aims to predict and display subsequent process nodes in a complex task process and improve user experience. The method comprises the steps of obtaining a task process; according to the task process, determining a logical relationship of process nodes contained in the task process, and predicting subsequent process nodes needing to be passed in the task process based on the logical relationship; and displaying subsequent process nodes needing to be passed in the task process.

Description

Technical Field

[0001] This application relates to the field of computer technology, specifically to a method, apparatus, device, medium, and program product for displaying a task flow. Background Technology

[0002] After initiating a task workflow, users can view it. The workflow can be displayed linearly, sorted by actual processing time, workflow nodes, and operations. Currently, only simple sequential task workflows are typically displayed. For complex task workflows, it's not possible to effectively view the subsequent expected workflow nodes and the personnel responsible for handling them. Summary of the Invention

[0003] In view of this, embodiments of this application provide a method, apparatus, device, medium, and program product for displaying task flows, which enables the prediction and display of subsequent process nodes in complex task flows, thereby improving user experience.

[0004] To address the above problems, the technical solutions provided in this application are as follows:

[0005] In a first aspect, embodiments of this application provide a method for displaying a task flow, the method comprising:

[0006] Obtain the task flow;

[0007] The logical relationship between the process nodes included in the task flow is determined based on the task flow, and the subsequent process nodes that need to be passed through in the task flow are predicted based on the logical relationship.

[0008] The subsequent process nodes that need to be passed in the task flow are displayed.

[0009] In one possible implementation, determining the logical relationships between the process nodes included in the task flow based on the task flow, and predicting the subsequent process nodes that need to be traversed in the task flow based on the logical relationships, includes:

[0010] Based on the task flow, it is determined that the task flow includes conditional branches. Based on the judgment conditions of the conditional branches and the node variables referenced by the conditional branches, the subsequent process nodes that need to be passed through in the conditional branches are predicted.

[0011] In one possible implementation, the method further includes:

[0012] If the node variable referenced by the conditional branch is not initialized, a prompt message will be displayed after the subsequent process nodes that need to be passed in the obtained task flow, indicating that the subsequent process nodes have not yet been determined.

[0013] In one possible implementation, determining the logical relationships between the process nodes included in the task flow based on the task flow, and predicting the subsequent process nodes that need to be traversed in the task flow based on the logical relationships, includes:

[0014] Based on the task flow, it is determined that the task flow includes parallel branches, and the process nodes in the parallel branches are determined as the subsequent process nodes that need to be passed through in the task flow.

[0015] The process of displaying the subsequent process nodes that need to be passed in the task flow includes:

[0016] Process nodes in multiple parallel branches at the same level are displayed as a unit of parallel branch. If any of the parallel branches includes multiple parallel branches at the next level, the process nodes in the multiple parallel branches at the next level are displayed as a unit of parallel branch.

[0017] In one possible implementation, determining the logical relationships between the process nodes included in the task flow based on the task flow, and predicting the subsequent process nodes that need to be traversed in the task flow based on the logical relationships, includes:

[0018] Based on the task flow, it is determined that the task flow includes a loop branch. Based on the loop condition of the loop branch and the node variables referenced by the loop branch, the subsequent process nodes that need to be traversed in the loop branch are predicted.

[0019] In one possible implementation, the method further includes:

[0020] If the node variable referenced by the loop branch is not initialized, a prompt message will be displayed after the subsequent process nodes that need to be passed through in the obtained task flow: "The subsequent process nodes have not yet been determined".

[0021] In one possible implementation, the task acquisition process includes:

[0022] Obtain the original task flow, and then remove the non-manual task flow nodes from the original task flow to form a new task flow.

[0023] In one possible implementation, the method further includes:

[0024] Display the node status corresponding to the subsequent process nodes that need to be passed in the task flow;

[0025] And / or,

[0026] If the task flow is determined to include branches based on the task flow, the branch state corresponding to the target branch is determined and displayed based on the node state corresponding to the process node in the target branch, where the target branch is any branch in the task flow.

[0027] In one possible implementation, if it is determined from the task flow that the task flow includes branches, and the target branch is a parallel branch, wherein the target branch is any branch in the task flow, the method further includes:

[0028] Expand or collapse the display of process nodes in the target branch based on the node status corresponding to the process nodes in the target branch.

[0029] In one possible implementation, expanding or collapsing the process nodes in the target branch according to their corresponding node states includes:

[0030] If the node status corresponding to the process node in the target branch is either not started or completed, collapse the process node in the target branch.

[0031] If any process node in the target branch has a node status of "in progress", expand and display the process nodes in the target branch.

[0032] In one possible implementation, the method further includes:

[0033] In response to a request to view the flowchart, the complete task flow is displayed.

[0034] Secondly, embodiments of this application provide a task flow display device, the device comprising:

[0035] The acquisition unit is used to acquire the task flow;

[0036] The prediction unit is used to determine the logical relationship between the process nodes included in the task flow according to the task flow, and predict the subsequent process nodes that need to be passed in the task flow based on the logical relationship.

[0037] The first display unit is used to display the subsequent process nodes that need to be passed in the task flow.

[0038] Thirdly, embodiments of this application provide a task flow display device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it implements the task flow display method as described in any of the above claims.

[0039] Fourthly, embodiments of this application provide a computer-readable storage medium storing instructions that, when executed on a terminal device, cause the terminal device to perform the task flow display method as described in any of the preceding claims.

[0040] Fifthly, embodiments of this application provide a computer program product comprising a computer program carried on a non-transitory computer-readable medium, the computer program including program code for performing the demonstration method of the task flow as described in any of the preceding claims.

[0041] Therefore, the embodiments of this application have the following beneficial effects:

[0042] In this embodiment, the task flow is read, the logical relationship between the process nodes in the task flow is determined, and the subsequent process nodes that need to be traversed in the task flow are predicted based on the logical relationship. These subsequent process nodes are then displayed. This allows users to view the expected subsequent process links and the responsible parties after triggering the task flow, enabling them to conduct pre-emptive communication or understand the expected progress of the task flow based on the predicted subsequent progress, thus improving the user experience. Attached Figure Description

[0043] Figure 1 A flowchart illustrating a task flow demonstration method provided in an embodiment of this application;

[0044] Figure 2 This is a schematic diagram illustrating a single-person processing node in the embodiments of this application.

[0045] Figure 3 This is a schematic diagram illustrating a process node that is a multi-person processing node in an embodiment of this application.

[0046] Figure 4 This is a schematic diagram illustrating the way process nodes are operation nodes in the embodiments of this application;

[0047] Figure 5 This is a schematic diagram illustrating a task flow including conditional branches in an embodiment of this application;

[0048] Figure 6 This is a schematic diagram illustrating another task flow including conditional branches in an embodiment of this application;

[0049] Figure 7 This is a schematic diagram illustrating a scenario where subsequent process nodes are not yet determined in an embodiment of this application;

[0050] Figure 8 This is a schematic diagram illustrating a task flow including parallel branches in an embodiment of this application;

[0051] Figure 9 This is a schematic diagram illustrating another task flow including parallel branches in an embodiment of this application;

[0052] Figure 10 This is a schematic diagram illustrating the node and branch states in the task flow of this application embodiment;

[0053] Figure 11 This is a schematic diagram illustrating the expansion or collapse of branches in the task flow in the embodiments of this application;

[0054] Figure 12 This is a schematic diagram illustrating the complete task flow in the embodiments of this application;

[0055] Figure 13 A schematic diagram of a task flow display device provided in an embodiment of this application;

[0056] Figure 14 This is a schematic diagram of an electronic device provided in an embodiment of this application. Detailed Implementation

[0057] To make the above-mentioned objectives, features and advantages of the embodiments of this application more apparent and understandable, the embodiments of this application will be further described in detail below with reference to the accompanying drawings and specific implementation methods.

[0058] To facilitate understanding and explanation of the technical solutions provided in the embodiments of this application, the background technology of the embodiments of this application will be described first below.

[0059] After initiating a task workflow, users can view it. The workflow can be displayed linearly, sorted by actual processing time, workflow nodes, and operations. Currently, only simple sequential task workflows are typically displayed. For complex task workflows, such as those involving branches or nesting, it's not possible to effectively view subsequent expected workflow nodes and their handlers. Furthermore, the complete topology and flow conditions of the task workflow are also unavailable.

[0060] Based on this, embodiments of this application provide a method, apparatus, device, medium, and program product for displaying task flows. According to the configured task flow content, relevant task node content is obtained, and the subsequent flow nodes and corresponding handlers of the task flow are predicted. Specifically, if the task flow contains conditional branches or loop branches, subsequent flow nodes are predicted and displayed in real time based on the branch or loop conditions. If the task flow contains parallel branches, subsequent flow nodes are predicted and displayed in parallel based on the content of each parallel branch. This allows users to view the expected subsequent flow links and handlers after triggering a task flow, improving the user experience.

[0061] To facilitate understanding of the embodiments of this application, the following description, in conjunction with the accompanying drawings, illustrates a method for demonstrating a task flow provided by the embodiments of this application.

[0062] See Figure 1 As shown, this figure is a flowchart of a task flow display method provided in an embodiment of this application, as follows. Figure 2 As shown, the method may include S101-S103:

[0063] S101: Obtain the task flow.

[0064] This application's embodiments can be applied to terminal devices. After a user initiates a task of a certain type, the corresponding task flow can be obtained. The task flow can be pre-set according to the task type. The task flow includes one or more flow nodes, and each flow node can correspond to a specific handler. For example, if a user initiates a reimbursement approval task, the complete reimbursement approval task flow can be obtained.

[0065] In this application embodiment, users usually pay more attention to process nodes related to manual tasks, such as process nodes that require approval. In order to make the task process display more effective, in one possible implementation, the specific implementation of S101 to obtain the task process may include: obtaining the original task process, removing the non-manual task process nodes in the original task process and then forming the task process.

[0066] After a user initiates a task of a certain type, the original task flow corresponding to that task can be obtained first. Non-manual task flow nodes are then removed; for example, automatically processed nodes are removed, leaving only manually processed nodes to form the task flow. This ensures that the task flow displayed subsequently only includes manually processed nodes.

[0067] S102: Determine the logical relationships between the process nodes included in the task flow based on the task flow, and predict the subsequent process nodes that need to be passed through in the task flow based on the logical relationships.

[0068] In complex task flows, the nodes within the flow may have different logical relationships. For example, a task flow may include branches, each branch containing one or more flow nodes, and branches can also be nested within each other. Branches can include, for example, conditional branches, loop branches, and parallel branches. A conditional branch executes the corresponding branch when a condition is met; a loop branch executes a branch repeatedly; and a parallel branch executes multiple branches simultaneously.

[0069] Based on the logical relationships between process nodes, the subsequent process nodes that need to be traversed in the task flow can be predicted. When a process node includes branches, the subsequent process nodes that need to be traversed in the task flow can be predicted based on the content of the branches. For example, if process node 1 is followed by conditional branch 1, and conditional branch 1 includes process nodes 2 and 3, then the predicted subsequent process nodes include process nodes 1, 2, and 3. As another example, if process node 4 is followed by a parallel branch, and the parallel branch includes branch 1 and branch 2, with branch 1 including process nodes 11 and 12, and branch 2 including process nodes 21 and 22, then the predicted subsequent process nodes include process node 4, process nodes 11, 12, 21, and 22.

[0070] The specific implementation of the predicted subsequent process nodes can be found in the description of the following embodiments, and will not be repeated here.

[0071] S103: Displays the subsequent process nodes that need to be passed in the task flow.

[0072] After predicting the subsequent process nodes that need to be passed through, a flowchart can be created to display these nodes in the order of execution. For example, a flowchart can be created to display the sequentially executed process nodes 1, 2, and 3.

[0073] In practical applications, this application also provides a way to display process nodes.

[0074] See Figure 2The diagram illustrates a display method where a process node is handled by a single person. In this display method, the following elements can be displayed: title 201, subtitle 202, node status 203, node handler 204, relevant time 205, task information placeholder 206, expansion slot 207, and left status line 208. The title, node handler, and left status line are essential information that needs to be displayed when the task flow is presented; other content can be displayed as needed. The title can display the name of the process node or the name of the task being performed. The subtitle can display auxiliary information related to the title, such as notes on approval logic. The node status can display the current running status of the process node, such as "approved," "not started," or "in progress." The node handler displays the specific person handling the current process node. The relevant time displays time information, such as arrival time and completion time. Task information placeholders are used to hold additional auxiliary information, such as text approval comments, displaying the person who handled the task before and after the transfer and the reason for the transfer in a transfer scenario, and displaying the person who handled the task before and after the return and the reason for the return in a return scenario. Extended slots are used to display other relevant information later, such as attachments, images, handwritten signatures, and other supplementary information in the approval comments. The status line on the left can indicate the status of relevant nodes; for example, different colors or line widths can be used to indicate whether the current process node has been executed.

[0075] See Figure 3 The diagram illustrates a display method for a multi-person processing node in the workflow. In this display method, the following elements can be displayed: title 301, subtitle 302, node status 303, node handler 304, single-person status 305, relevant time 306, task information placeholder 307, expansion slot 308, and left-side status line 309. The title, node handler, and left-side status line are essential information that the workflow node needs to display during task flow display; other content can be displayed as needed. The single-person status can display the current handler's status, such as "Passed," "Not Started," or "In Progress." For explanations of other displayed content, please refer to the preceding description. In a multi-person processing node, multiple node handlers can be displayed. In practical applications, for example, when a node status is "not started," multiple node handlers can be aggregated and displayed, such as in a horizontal arrangement; when a multi-person processing node is a multi-person approval node involving countersigning or signing, and the node status is "in progress," each node handler can be arranged vertically, with the corresponding individual status being "in progress"; when a multi-person processing node is a multi-person approval node involving sequential or hierarchical approval, the node handlers and their corresponding individual statuses are displayed vertically in the order of approval.

[0076] See Figure 4The diagram illustrates a display method where process nodes are function nodes. In this display method, the following elements can be displayed: title 401, subtitle 402, node status 403, node operator 404, affected personnel 405, relevant time 406, task information placeholder 407, expansion slot 408, and left-side status line 409. The title, node operator, and left-side status line are essential information displayed when showcasing the task flow; other content can be displayed as needed. Function nodes display relevant information about operations, such as forwarding, copying, signing, and returning approvals, generating corresponding function nodes. The node operator displays the specific operator of the current process node, and the affected personnel display those affected by the current operation, such as those receiving copies or forwarding the operation.

[0077] The process nodes in this embodiment more clearly demonstrate the reason for each process node, who is handling it, what processing is performed, its status, and the rationale, making the information display clearer and providing a better overall perspective. It is understood that this embodiment does not limit the specific display method of process nodes and can be adjusted according to actual circumstances.

[0078] In this embodiment, the task flow is read, the logical relationship between the process nodes in the task flow is determined, and the subsequent process nodes that need to be traversed in the task flow are predicted based on the logical relationship. These subsequent process nodes are then displayed. This allows users to view the expected subsequent process links and the responsible parties after triggering the task flow, enabling them to conduct pre-emptive communication or understand the expected progress of the task flow based on the predicted subsequent progress, thus improving the user experience.

[0079] The following section further explains how to predict and display subsequent process nodes when the task flow includes branches, specifically conditional branches, cyclic branches, or parallel branches.

[0080] In one possible implementation, S102 determines the logical relationships between the process nodes included in the task flow based on the task flow, and predicts the subsequent process nodes that need to be traversed in the task flow based on the logical relationships, including:

[0081] Based on the task flow, determine that the task flow includes conditional branches. Based on the judgment conditions of the conditional branches and the node variables referenced by the conditional branches, predict the subsequent process nodes that need to be passed in the conditional branches.

[0082] If the task flow includes conditional branches, after the node variables referenced by the conditional branches are initialized, these node variables are used to determine which conditional branch to execute next, thus predicting the subsequent process nodes that need to be traversed. For example, in a reimbursement approval process, if the node variable "reimbursement amount" is greater than 1000 yuan, conditional branch 1 is executed; otherwise, conditional branch 2 is executed. The conditional branch to be executed can be determined based on the specific value of the reimbursement amount, and the process nodes in this conditional branch are all subsequent process nodes that need to be traversed.

[0083] See Figure 5 The diagram illustrates a task flow with conditional branches. In this example, user A initiates a reimbursement approval process. The conditional branch references a node variable indicating a reimbursement amount greater than 1000 yuan, thus executing conditional branch 1. Conditional branch 1 includes two process nodes: direct superior approval and financial approval. Following conditional branch 1, a supervisor approval process node must be executed. The diagram then displays the task flow including these process nodes.

[0084] See Figure 6 The diagram illustrates another task flow that includes conditional branches. In this example, user A initiates a reimbursement approval process. The conditional branch references a node variable indicating that the reimbursement amount is less than 1000 yuan, thus executing conditional branch 2. Conditional branch 2 includes a financial approval node, and after conditional branch 2, a supervisor approval node needs to be executed. The task flow including these nodes can then be displayed.

[0085] As can be seen from the two examples above, when the node variables referenced by the conditional branches have different values, different subsequent process nodes that need to be passed can be predicted. Then, the corresponding task flow is displayed according to the actual situation, so that users can know the actual execution chain of the task flow.

[0086] One possible implementation may also include:

[0087] If the node variable referenced by the conditional branch is not initialized, a message will be displayed after the subsequent process nodes that need to be traversed in the obtained task flow, indicating that the subsequent process nodes have not yet been determined.

[0088] In some scenarios, node variables referenced by branch conditions may not be initialized. In such cases, it's impossible to predict the corresponding conditional branches. Therefore, a message indicating that the subsequent process node is not yet determined can be displayed after the predicted subsequent process node. In practical applications, it's also possible to determine the subsequent process node but not the corresponding handler. In this case, a message indicating that the handler cannot be determined can also be displayed at the handler position of the process node.

[0089] See Figure 7The diagram illustrates a scenario where the next process step is not yet determined. If there are conditional branches following approval from the immediate supervisor, but the branch to be executed cannot be determined at this time, a message indicating that the next process step is not yet determined can be displayed to inform the user of this situation.

[0090] In one possible implementation, S102 determines the logical relationships between the process nodes included in the task flow based on the task flow, and the specific implementation of predicting the subsequent process nodes that need to be traversed in the task flow based on the logical relationships may include:

[0091] Based on the task flow, it is determined that the task flow includes loop branches. Based on the loop condition of the loop branch and the node variables referenced by the loop branch, the subsequent process nodes that need to be traversed in the loop branch are predicted.

[0092] If the task flow includes loop branches, after the node variables referenced by the loop branches are initialized, these node variables are used to determine whether to execute the loop branch, thus predicting the subsequent process nodes that need to be traversed. For example, when the loop condition of loop branch 1 is met, the process nodes included in loop branch 1 can be identified as the subsequent process nodes that need to be traversed. Generally, the subsequent process nodes that need to be traversed can be predicted based on the case of one loop.

[0093] One possible implementation may also include:

[0094] If the node variable referenced by the loop branch is not initialized, a message will be displayed after the subsequent process node that needs to be traversed in the obtained task flow: "The subsequent process node has not yet been determined".

[0095] Similarly, in some scenarios, there may be situations where the node variables referenced by the loop condition are not initialized. In such cases, it is impossible to predict the corresponding loop branch. In this case, a prompt message indicating that the subsequent process node has not yet been determined can be displayed after the predicted subsequent process node, so that users can be aware of this situation in a timely manner.

[0096] In one possible implementation, S102 determines the logical relationships between the process nodes included in the task flow based on the task flow, and the specific implementation of predicting the subsequent process nodes that need to be traversed in the task flow based on the logical relationships may include:

[0097] Based on the task flow, it is determined that the task flow includes parallel branches, and the process nodes in the parallel branches are determined as the subsequent process nodes that need to be passed through in the task flow.

[0098] The specific implementation of S103, which displays the subsequent process nodes that need to be passed in the task flow, may include:

[0099] The process nodes in multiple parallel branches at the same level are displayed as a unit of parallel branch. If any parallel branch includes multiple parallel branches at the next level, the process nodes in the multiple parallel branches at the next level are displayed as a unit of parallel branch.

[0100] When a task flow includes parallel branches, the process nodes within multiple parallel branches can be displayed as a unit. See also Figure 8 The diagram illustrates a task flow diagram including parallel branches. In this example, after user A initiates the task flow, parallel branches (branch 1 and branch 2) exist. Branch 1 and branch 2 are parallel branches at the same level, so the process nodes included in branch 1 and branch 2 can be displayed sequentially. Further process nodes can follow the parallel branches, such as the final supervisor approval process node. This display method clearly shows the parallel branches and their relationships with other process nodes.

[0101] See Figure 9 The diagram illustrates another task flow diagram that includes parallel branches. In this example, multiple parallel branches at the next lower level can be nested within each parallel branch, displaying the process nodes of those branches on a per-branch basis. For instance, after user A initiates a task flow, there are parallel branches (branch 1 and branch 2). Branch 1 and branch 2 are parallel branches at the same level, so the process nodes included in branch 1 and branch 2 can be displayed sequentially. Branch 1 further contains nested parallel branches (branch 11 and branch 12), which are parallel branches at the same level, representing the next level of branch 1. Therefore, the process nodes included in branch 11 and branch 12 can be displayed sequentially within branch 1. Following the parallel branches (branch 1 and branch 2) can be other process nodes, such as the final supervisor approval process node. This display method clearly shows the hierarchy of the task flow, even when dealing with complex task flows, such as those with multi-level nested branches.

[0102] Based on the above embodiments, the method provided in this application may further include:

[0103] Display the node status of each subsequent process node that needs to be passed in the task flow.

[0104] And / or,

[0105] If the task flow is determined to include branches, the branch status corresponding to the process node in the target branch is determined and displayed based on the node status of the process node in the target branch. The target branch is any branch in the task flow.

[0106] To help users understand the execution status of the task flow, the node status of each process node can be displayed when showing the task flow. If there are branches in the task flow, the branch status can also be determined and displayed based on the node status of each process node in the branch.

[0107] Node status can include, for example, in progress, approved, completed, not started, or returned, and can be determined based on the actual execution status of the process node. For example, for a process node whose operation has been returned, the node status can be changed from in progress to returned; for a completed process node, the node status can be approved for approval nodes, and completed for operation nodes such as copying or filling out forms; when a branch no longer needs to be executed, if there is an in progress process node, the node status can be changed to automatically terminated, and so on.

[0108] Branch status can include, for example, in progress, passed, completed, not started, or rolled back, and can be determined based on the actual execution status of the branch. For example, if all process nodes in a branch have been completed, the branch status is completed; if there are process nodes in progress in a branch, the branch status is in progress; for branches containing process nodes that have been rolled back, the branch status can be changed from in progress to rolled back, and so on.

[0109] See Figure 10 The diagram illustrates the node and branch states in a task flow. In this example, for instance, the node state of each process node can be displayed; if there are process nodes in branch 1 with a state of "in progress," then the branch state of branch 1 is "in progress"; if all process nodes in branch 2 have a state of "passed," then the branch state of branch 2 is "passed."

[0110] In this embodiment of the application, by displaying the node status of process nodes and the branch status of branches, the information displayed for the task process is richer, thereby improving the user experience.

[0111] In one possible implementation, if the task flow is determined to include branches, and the target branch is a parallel branch, and the target branch is any branch in the task flow, it may further include:

[0112] Expand or collapse the display of process nodes in the target branch based on the node status corresponding to the process nodes in the target branch.

[0113] To make the task flow display more reasonable and concise, when the task flow includes parallel branches, the process nodes in the parallel branches can be expanded or collapsed according to their node status.

[0114] In one possible implementation, the specific implementation of expanding or collapsing the display of process nodes in the target branch based on the node status of the process nodes in the target branch may include:

[0115] If all process nodes in the target branch have a status of either "not started" or "completed", collapse the display of process nodes in the target branch.

[0116] If any process node in the target branch has a status of "in progress", expand and display the process nodes in the target branch.

[0117] See Figure 11 The diagram illustrates the expansion and collapse of branches in a task flow. If none of the process nodes in a branch have started or have been completed, the user can temporarily disregard the specific process nodes within that branch, and thus the process nodes in that branch can be collapsed. For example, if all process nodes in branch 2 have been completed, and the branch status of branch 2 is "completed," then the specific process nodes included in branch 2 can be collapsed and not displayed. Conversely, if there are ongoing process nodes in a branch, indicating that the user might be interested in the execution status of that branch, then the process nodes in that branch will be expanded and displayed. For example, if there are ongoing process nodes in branch 1, then all process nodes in branch 1 need to be expanded and displayed.

[0118] In practical applications, users can also trigger changes to the expanded or collapsed state of branches. When a process node in a branch is collapsed, the user can expand the branch to display all process nodes within it. Conversely, if the user is not interested in a branch when its process nodes are expanded, they can collapse the branch to hide its process nodes by triggering the branch.

[0119] In this embodiment, parallel branches can be collapsed or expanded, making the task flow display more suitable for practical application scenarios.

[0120] Based on the above explanation, when displaying a task flow through prediction, users may not be able to see the complete task flow topology and branching conditions. For example, in an expense reimbursement approval scenario, different reimbursement amounts may follow different conditional branches. Users can view the task flow after initiating the process, such as... Figure 5 and Figure 6These are all task flow diagrams for the reimbursement approval process. Users cannot know why these individuals are responsible for approvals, or under what circumstances they are authorized to approve them. This leads to situations where, after initiating multiple approval processes with different data, users find that the executed approval processes are inconsistent, but they are unclear about the judgment conditions. Therefore, this application embodiment also provides an implementation demonstrating the complete task flow. In one possible implementation, the method provided by this application embodiment may further include:

[0121] In response to a request to view the flowchart, display the complete task flow.

[0122] See Figure 12 As shown, a schematic diagram illustrating the complete task flow is presented.

[0123] A complete task flow can display the actual execution path of the task, including the current execution node, which nodes have been executed, and which nodes have not been executed. If branches exist, the execution conditions of each branch are shown, which branch was executed, and the number of iterations for each loop branch. If nested branches exist, the nested logic for each branch will also be displayed. This achieves a complete task flow display, allowing users to clearly view the task flow's topology and branch conditions.

[0124] Based on the task flow display method provided in the above method embodiments, this application embodiment also provides a task flow display device, which will be described below with reference to the accompanying drawings.

[0125] See Figure 13 As shown, this figure is a structural schematic diagram of a task flow display device provided in an embodiment of this application. Figure 13 As shown, the demonstration device for this task flow includes:

[0126] Acquisition unit 1301 is used to acquire the task flow;

[0127] The prediction unit 1302 is used to determine the logical relationship of the process nodes included in the task flow according to the task flow, and predict the subsequent process nodes that need to be passed in the task flow based on the logical relationship.

[0128] The first display unit 1303 is used to display the subsequent process nodes that need to be passed in the task process.

[0129] In one possible implementation, the prediction unit is specifically used for:

[0130] Based on the task flow, it is determined that the task flow includes conditional branches. Based on the judgment conditions of the conditional branches and the node variables referenced by the conditional branches, the subsequent process nodes that need to be passed through in the conditional branches are predicted.

[0131] In one possible implementation, the first display unit is further configured to:

[0132] If the node variable referenced by the conditional branch is not initialized, a prompt message will be displayed after the subsequent process nodes that need to be passed in the obtained task flow, indicating that the subsequent process nodes have not yet been determined.

[0133] In one possible implementation, the prediction unit is specifically used for:

[0134] Based on the task flow, it is determined that the task flow includes parallel branches, and the process nodes in the parallel branches are determined as the subsequent process nodes that need to be passed through in the task flow.

[0135] The first display unit is specifically used for:

[0136] Process nodes in multiple parallel branches at the same level are displayed as a unit of parallel branch. If any of the parallel branches includes multiple parallel branches at the next level, the process nodes in the multiple parallel branches at the next level are displayed as a unit of parallel branch.

[0137] In one possible implementation, the prediction unit is specifically used for:

[0138] Based on the task flow, it is determined that the task flow includes a loop branch. Based on the loop condition of the loop branch and the node variables referenced by the loop branch, the subsequent process nodes that need to be traversed in the loop branch are predicted.

[0139] In one possible implementation, the first display unit is further configured to:

[0140] If the node variable referenced by the loop branch is not initialized, a prompt message will be displayed after the subsequent process nodes that need to be passed through in the obtained task flow: "The subsequent process nodes have not yet been determined".

[0141] In one possible implementation, the acquisition unit is specifically used for:

[0142] Obtain the original task flow, and then remove the non-manual task flow nodes from the original task flow to form a new task flow.

[0143] In one possible implementation, the first display unit is further configured to:

[0144] Display the node status corresponding to the subsequent process nodes that need to be passed in the task flow;

[0145] And / or,

[0146] If the task flow is determined to include branches based on the task flow, the branch state corresponding to the target branch is determined and displayed based on the node state corresponding to the process node in the target branch, where the target branch is any branch in the task flow.

[0147] In one possible implementation, if it is determined from the task flow that the task flow includes branches, and the target branch is a parallel branch, wherein the target branch is any branch in the task flow, the first display unit is further configured to:

[0148] Expand or collapse the display of process nodes in the target branch based on the node status corresponding to the process nodes in the target branch.

[0149] In one possible implementation, the first display unit is specifically used for:

[0150] If the node status corresponding to the process node in the target branch is either not started or completed, collapse the process node in the target branch.

[0151] If any process node in the target branch has a node status of "in progress", expand and display the process nodes in the target branch.

[0152] In one possible implementation, the device further includes:

[0153] The second display unit is used to display the complete task flow in response to a request to view the flowchart.

[0154] In this embodiment, the task flow is read, the logical relationship between the process nodes in the task flow is determined, and the subsequent process nodes that need to be traversed in the task flow are predicted based on the logical relationship. These subsequent process nodes are then displayed. This allows users to view the expected subsequent process links and the responsible parties after triggering the task flow, enabling them to conduct pre-emptive communication or understand the expected progress of the task flow based on the predicted subsequent progress, thus improving the user experience.

[0155] This application also provides a computer program product, including computer program instructions, which, when executed on a computer, cause the computer to perform the task flow display method as described in any of the above embodiments.

[0156] Based on the task flow display method provided in the above method embodiments, this application also provides an electronic device, including: one or more processors; a storage device storing one or more programs thereon, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the task flow display method described in any of the above embodiments.

[0157] The following is for reference. Figure 14 This document illustrates a structural schematic diagram of an electronic device 1400 suitable for implementing embodiments of this application. The terminal devices in these embodiments may include, but are not limited to, mobile terminals such as mobile phones, laptops, digital broadcast receivers, PDAs (Personal Digital Assistants), PADs (Portable Android Devices), PMPs (Portable Media Players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and fixed terminals such as digital TVs (televisions), desktop computers, etc. Figure 14 The electronic device shown is merely an example and should not impose any limitation on the functionality and scope of use of the embodiments of this application.

[0158] like Figure 14 As shown, electronic device 1400 may include a processing device (e.g., a central processing unit, a graphics processor, etc.) 1401, which can perform various appropriate actions and processes according to a program stored in read-only memory (ROM) 1402 or a program loaded from storage device 1408 into random access memory (RAM) 1403. RAM 1403 also stores various programs and data required for the operation of electronic device 1400. Processing device 1401, ROM 1402, and RAM 1403 are interconnected via bus 1404. Input / output (I / O) interface 1405 is also connected to bus 1404.

[0159] Typically, the following devices can be connected to I / O interface 1405: input devices 1406 including, for example, touchscreens, touchpads, keyboards, mice, cameras, microphones, accelerometers, gyroscopes, etc.; output devices 1407 including, for example, liquid crystal displays (LCDs), speakers, vibrators, etc.; storage devices 1408 including, for example, magnetic tapes, hard disks, etc.; and communication devices 1409. Communication device 1409 allows electronic device 1400 to communicate wirelessly or wiredly with other devices to exchange data. Although Figure 14 An electronic device 1400 with various devices is shown; however, it should be understood that it is not required to implement or possess all of the devices shown. More or fewer devices may be implemented or possessed alternatively.

[0160] Specifically, according to embodiments of this application, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments of this application include a computer program product comprising a computer program carried on a non-transitory computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via communication device 1409, or installed from storage device 1408, or installed from ROM 1402. When the computer program is executed by processing device 1401, it performs the functions defined in the methods of embodiments of this application.

[0161] The electronic device provided in this application embodiment and the task flow display method provided in the above embodiment belong to the same inventive concept. Technical details not described in detail in this embodiment can be found in the above embodiment, and this embodiment has the same beneficial effects as the above embodiment.

[0162] Based on the task flow display method provided in the above method embodiments, this application provides a computer-readable medium storing a computer program thereon, wherein the program, when executed by a processor, implements the task flow display method as described in any of the above embodiments.

[0163] It should be noted that the computer-readable medium described in the embodiments of this application can be a computer-readable signal medium, a computer-readable storage medium, or any combination thereof. A computer-readable storage medium can be, for example,—but not limited to—an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of a computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof. In the embodiments of this application, a computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In the embodiments of this application, a computer-readable signal medium can include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium can be any computer-readable medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium can be transmitted using any suitable medium, including but not limited to: wires, optical fibers, RF (radio frequency), etc., or any suitable combination thereof.

[0164] In some implementations, clients and servers can communicate using any currently known or future-developed network protocol such as HTTP (Hypertext Transfer Protocol) and can interconnect with digital data communication (e.g., communication networks) of any form or medium. Examples of communication networks include local area networks (“LANs”), wide area networks (“WANs”), the Internet (e.g., the Internet of Things), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future-developed networks.

[0165] The aforementioned computer-readable medium may be included in the aforementioned electronic device; or it may exist independently and not assembled into the electronic device.

[0166] The aforementioned computer-readable medium carries one or more programs, and when the aforementioned one or more programs are executed by the electronic device, the electronic device performs the aforementioned task flow demonstration method.

[0167] Computer program code for performing the operations of the embodiments of this application can be written in one or more programming languages ​​or a combination thereof. These programming languages ​​include, but are not limited to, object-oriented programming languages ​​such as Java, Smalltalk, and C++, as well as conventional procedural programming languages ​​such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a local area network (LAN) or a wide area network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0168] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0169] The units described in the embodiments of this application can be implemented in software or hardware. The names of the units / modules do not necessarily limit the specific unit itself.

[0170] The functions described above in this document can be performed at least in part by one or more hardware logic components. For example, exemplary types of hardware logic components that can be used, without limitation, include: field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), system-on-a-chip (SoCs), complex programmable logic devices (CPLDs), and so on.

[0171] In the context of embodiments of this application, a machine-readable medium can be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, apparatus, or device. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. Machine-readable media can include, but are not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0172] It should be noted that the various embodiments in this specification are described in a progressive manner, with each embodiment focusing on the differences from other embodiments. Similar or identical parts between embodiments can be referred to interchangeably. For the systems or apparatus disclosed in the embodiments, since they correspond to the methods disclosed in the embodiments, the descriptions are relatively simple, and relevant parts can be referred to the method section.

[0173] It should be understood that in this application, "at least one (item)" means one or more, and "more than" means two or more. "And / or" is used to describe the relationship between related objects, indicating that three relationships can exist. For example, "A and / or B" can represent three cases: only A exists, only B exists, and both A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) of a, b, or c can represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple.

[0174] It should also be noted that, in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0175] The steps of the methods or algorithms described in conjunction with the embodiments disclosed herein can be implemented directly by hardware, a software module executed by a processor, or a combination of both. The software module can be located in random access memory (RAM), main memory, read-only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium known in the art.

[0176] The above description of the disclosed embodiments enables those skilled in the art to make or use this application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of this application. Therefore, this application is not to be limited to the embodiments shown herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. A method for displaying a task flow, characterized in that, The method comprises: obtaining a task flow; determining a logical relationship of flow nodes contained in the task flow according to the task flow, predicting subsequent flow nodes to be passed through in the task flow based on the logical relationship; displaying the subsequent flow nodes to be passed through in the task flow.

2. The method of claim 1, wherein, The determining of the logical relationship of flow nodes contained in the task flow according to the task flow, and the predicting of subsequent flow nodes to be passed through in the task flow based on the logical relationship, comprise: determining that the task flow comprises a conditional branch according to the task flow, and predicting subsequent flow nodes to be passed through in the conditional branch according to a judgment condition of the conditional branch and a node variable referenced by the conditional branch.

3. The method of claim 2, wherein, The method further comprises: if the node variable referenced by the conditional branch is not initialized, displaying prompt information of a subsequent flow node to be determined after the obtained subsequent flow nodes to be passed through in the task flow.

4. The method of claim 1, wherein, The determining of the logical relationship of flow nodes contained in the task flow according to the task flow, and the predicting of subsequent flow nodes to be passed through in the task flow based on the logical relationship, comprise: determining that the task flow comprises a parallel branch according to the task flow, and determining flow nodes in the parallel branch as the subsequent flow nodes to be passed through in the task flow; The displaying of the subsequent flow nodes to be passed through in the task flow, comprises: displaying the flow nodes in multiple parallel branches of the same level in units of parallel branches, and if any of the parallel branches comprises multiple parallel branches of a next level, displaying the flow nodes in the multiple parallel branches of the next level in units of parallel branches in the parallel branch.

5. The method of claim 1, wherein, The determining of the logical relationship of flow nodes contained in the task flow according to the task flow, and the predicting of subsequent flow nodes to be passed through in the task flow based on the logical relationship, comprise: determining that the task flow comprises a loop branch according to the task flow, and predicting subsequent flow nodes to be passed through in the loop branch according to a loop condition of the loop branch and a node variable referenced by the loop branch.

6. The method of claim 5, wherein, The method further comprises: if the node variable referenced by the loop branch is not initialized, displaying prompt information of a subsequent flow node to be determined after the obtained subsequent flow nodes to be passed through in the task flow.

7. The method of claim 1, wherein, The obtaining of the task flow, comprises: obtaining an original task flow, and removing non-manual task flow nodes in the original task flow to form the task flow.

8. The method according to any one of claims 1 to 7, characterized in that, The method further comprises: displaying a node state corresponding to the subsequent flow nodes to be passed through in the task flow; and / or, if it is determined according to the task flow that the task flow comprises a branch, determining and displaying a branch state corresponding to a target branch according to a node state corresponding to a flow node in the target branch, the target branch being any branch in the task flow.

9. The method according to any one of claims 1 to 7, characterized in that, if it is determined according to the task flow that the task flow comprises a branch, and the target branch is a parallel branch, the target branch being any branch in the task flow, the method further comprises: According to the node state corresponding to the flow node in the target branch, the flow node in the target branch is unfolded or folded.

10. The method of claim 9, wherein, The unfolding or folding of the flow node in the target branch according to the node state corresponding to the flow node in the target branch comprises: If the node state corresponding to the flow node in the target branch is all not started or completed, the flow node in the target branch is folded; If the node state corresponding to any flow node in the target branch is in progress, the flow node in the target branch is unfolded.

11. The method according to any one of claims 1 to 10, characterized in that, The method further comprises: In response to a request to view the flowchart, the complete task flow is displayed.

12. A presentation device of a task flow, characterized by, The device comprises: An acquisition unit is configured to acquire a task flow; A prediction unit is configured to determine a logical relationship of flow nodes included in the task flow according to the task flow, and predict a subsequent flow node to be passed through in the task flow based on the logical relationship; A first display unit is configured to display the subsequent flow node to be passed through in the task flow.

13. A presentation device of a task flow, characterized by, It comprises: A memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements the task flow display method according to any one of claims 1-11 when executing the computer program.

14. A computer readable storage medium characterized by, The computer readable storage medium stores instructions, and when the instructions run on the terminal device, the terminal device executes the task flow display method according to any one of claims 1-11.

15. A computer program product, characterised in that, It comprises a computer program carried on a non-transitory computer readable medium, and the computer program comprises program codes for executing the task flow display method according to any one of claims 1-11.

Images