Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Stream node jumping method and device, server and storage medium

A node and jump technology, applied in the computer field, can solve problems such as inability to realize complex process jumps, inflexibility, etc.

Pending Publication Date: 2019-08-20
中汽数据(天津)有限公司
View PDF4 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] At present, the mainstream open source workflow engines mainly include Activiti and Flowable. These workflow engines can only realize basic process processing, and the jump between nodes can only be solved by connecting when the process is defined, which is not flexible and cannot realize complex Process jump

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Stream node jumping method and device, server and storage medium
  • Stream node jumping method and device, server and storage medium
  • Stream node jumping method and device, server and storage medium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0046] figure 1 It is a flowchart of a flow node jumping method provided by Embodiment 1 of the present invention. This embodiment is applicable to the situation where there are multiple task nodes, and each task node can be jumped between, for example, it can be applied to reimbursement, leave and In a process such as a business trip, the method can be executed by the stream node jumping device provided in the embodiment of the present invention. The device can be implemented in the form of software and / or hardware, and is usually integrated in the server. Specifically, the method includes the following steps:

[0047] S110. Obtain the task topology structure of the to-do task, and determine the attribute information of each node in the task topology structure.

[0048] A pending task can be a task that includes multiple subtasks, such as leave approval, travel reimbursement approval, or expense reimbursement approval. For example, when the pending task is expense reimburseme...

Embodiment 2

[0062] image 3 It is a flowchart of a flow node jumping method provided by Embodiment 2 of the present invention. This embodiment is embodied on the basis of the above embodiments. Specifically, the method includes the following steps:

[0063] S210. Obtain the task topology structure of the to-do task, and determine the attribute information of each node in the task topology structure.

[0064] S220. Determine the current execution node of the to-do task.

[0065] S230. Determine, according to the attribute information of the current execution node, candidate nodes to which the current execution node is to jump, and send each determined candidate node to the client.

[0066] Candidate nodes are nodes that the current execution node can jump to. According to the attribute information of the current execution node, such as node type, the candidate nodes that the current execution node can jump to are determined. For example, the execution order of a certain task topology is ...

example 1

[0079] refer to Figure 4 , Figure 4It is a schematic diagram of the first flow node jump. In addition to the start node and end node, the task topology structure also includes three task nodes, namely node A, node B and node C, which are executed in the order from node A to node B and then to node C. Node A, node Node B and node C are both main process task nodes. Assuming that the current execution node is node A, the candidate nodes of node A are determined to be node B and node C according to the node type of node A. If the user selects node C as the target node, since node A and node C are both main process task nodes, Then it is determined that the instruction to be jumped is a jump instruction from the main process task node to the main process task node, and the interface to be processed is controlled to jump from the first operation interface corresponding to node A to the second operation interface corresponding to node C according to the instruction to be jumped ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The embodiment of the invention discloses a stream node jumping method and device, a server and a storage medium. The method comprises the following steps of: obtaining a task topological structure ofthe to-do task, determining attribute information of each node in the task topological structure, and determining a current execution node of the to-do task, receiving a target node sent by a user side, and completing the skip from the current execution node to the target node according to the attribute information of the current execution node and the target node, so that the target node servesas a new current execution node. Compared with the prior art, the technical scheme of the embodiment of the invention has the advantages that after the current execution node and the target node are determined, the skip from the current execution node to the target node is completed according to the attribute information of the current node and the target node, the skip between the nodes can be realized without a connecting line, and the method is simple and flexible.

Description

technical field [0001] The embodiments of the present invention relate to the field of computer technology, and in particular, to a flow node jump method, device, server, and storage medium. Background technique [0002] Workflow is an abstract and general description of business rules between workflow and its various operation steps. It is a kind of automatic transfer of documents and information among multiple participants by using computers according to certain predetermined rules in order to achieve a certain business goal. or task workflow. Each subtask in a workflow is called a node, and each workflow can include multiple nodes. Node jumping is data jumping from one node to another node. In practical applications, it is usually necessary to use node jumping to complete certain tasks. [0003] At present, the mainstream open source workflow engines mainly include Activiti and Flowable. These workflow engines can only realize basic process processing, and the jump betw...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06Q10/10G06F9/48
CPCG06Q10/103G06F9/4881
Inventor 董长青陈辰任女尔蔡建军
Owner 中汽数据(天津)有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com