CN110958178A - Method and device for determining shortest path between systems - Google Patents
Method and device for determining shortest path between systems Download PDFInfo
- Publication number
- CN110958178A CN110958178A CN201911189256.0A CN201911189256A CN110958178A CN 110958178 A CN110958178 A CN 110958178A CN 201911189256 A CN201911189256 A CN 201911189256A CN 110958178 A CN110958178 A CN 110958178A
- Authority
- CN
- China
- Prior art keywords
- shortest path
- determining
- directed graph
- nodes
- weighted directed
- 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.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- 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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Theoretical Computer Science (AREA)
- Signal Processing (AREA)
- Marketing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Game Theory and Decision Science (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Technology Law (AREA)
- Operations Research (AREA)
- Entrepreneurship & Innovation (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a method and a device for determining the shortest path between systems, wherein the method comprises the following steps: determining a weighted directed graph according to the connection relation between systems, wherein the weighted directed graph comprises: a plurality of nodes and arcs between nodes; setting one node in the optional weighted directed graph as a starting point, taking other nodes as end points, and determining the shortest path from the starting point to each end point; and changing the initial point of the weighted directed graph, and repeatedly obtaining the shortest path of each node in the weighted directed graph. The invention utilizes the connection relationship between the bank system and the system to establish the authorized digraph, simplifies the complex system connection relationship into the authorized digraph, and truly simulates the connection condition between the system and the system; then, the shortest path can be rapidly solved by utilizing the directed graph, and scientific reference and selection are provided for designing a transaction link between systems.
Description
Technical Field
The invention relates to the technical field of network connection of bank systems, in particular to a method and a device for determining the shortest path between systems.
Background
At present, the internal systems of banks are numerous, especially large banks, the number of the systems is at least hundreds, and the transactions involved in the systems are more tens of thousands. This necessarily results in many transaction paths from one system to another.
However, due to the influence of various factors such as the performance of each system and the difficulty of modification, different transaction paths have different degrees of quality, and therefore the shortest path cannot be accurately selected when the connection is established between the systems.
Disclosure of Invention
The method for determining the shortest path between systems provided by the embodiment of the invention can quickly generate the shortest path when establishing connection between the systems, and comprises the following steps:
determining a weighted directed graph according to the connection relation between systems, wherein the weighted directed graph comprises: a plurality of nodes and arcs between nodes;
setting one node in the optional weighted directed graph as a starting point, taking other nodes as end points, and determining the shortest path from the starting point to each end point;
and changing the initial point of the weighted directed graph, and repeatedly obtaining the shortest path of each node in the weighted directed graph.
The embodiment of the present invention further provides a device for determining a shortest path between systems, including:
the determination module of the weighted directed graph is used for determining the weighted directed graph according to the connection relation between systems, and the weighted directed graph comprises: a plurality of nodes and arcs between nodes;
the single-node shortest path determining module is used for setting one node in the optional weighted directed graph as a starting point, taking other nodes as end points and determining the shortest path from the starting point to each end point;
and the module for repeatedly calculating the shortest paths of all the nodes is used for replacing the initial point of the weighted directed graph and repeatedly calculating the shortest path of each node in the weighted directed graph.
The embodiment of the present invention further provides a computer device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, the processor implements the above method for determining a shortest path between systems.
An embodiment of the present invention further provides a computer-readable storage medium, which stores a computer program for executing the method for determining the shortest path between systems.
According to the method and the device for determining the shortest path, which are provided by the embodiment of the invention, the connection relationship between the bank system and the system is utilized to establish the weighted directed graph, the complex system connection relationship is simplified into the weighted directed graph, and the connection condition between the system and the system is truly simulated; then, the shortest path can be rapidly solved by utilizing the directed graph, and scientific reference and selection are provided for designing a transaction link between systems.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts. In the drawings:
fig. 1 is a schematic diagram of a method for determining a shortest path between systems according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of an example weighted directed graph of a method for determining a shortest path between systems according to an embodiment of the present invention.
Fig. 3 is a schematic diagram of an apparatus for determining a shortest path between systems according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the embodiments of the present invention are further described in detail below with reference to the accompanying drawings. The exemplary embodiments and descriptions of the present invention are provided to explain the present invention, but not to limit the present invention.
As shown in fig. 1, a schematic diagram of a method for determining a shortest path between systems according to an embodiment of the present invention is shown, where the method for determining a shortest path between systems according to an embodiment of the present invention is capable of quickly generating a shortest path when a connection is established between systems, and the method includes:
and 103, replacing the starting point of the weighted directed graph, and repeatedly obtaining the shortest path of each node in the weighted directed graph.
The method for determining the shortest path provided by the embodiment of the invention establishes the weighted directed graph by using the connection relationship between the bank system and the system, simplifies the complex system connection relationship into the weighted directed graph, and truly simulates the connection condition between the system and the system; then, the shortest path can be rapidly solved by utilizing the directed graph, and scientific reference and selection are provided for designing a transaction link between systems.
In the method for determining the shortest path according to the embodiment of the present invention, in specific implementation, the directed graph may include: in a graph-like structure, the connection of one point to another is directional, the connection line is an arc, the starting point of the arc is the starting point, and the ending point of the arc is the ending point. In the embodiment of the invention, the arc is a network connection, the starting point is a request system, and the end point is a service system. The involved weighted directed graph may include: on the arcs of the directed graph, there are numbers associated with the arcs, and such graph is a weighted directed graph, with the numbers associated with the arcs being weights. The related shortest transaction path refers to an optimal transaction link after various factors are considered comprehensively in general, and in the embodiment of the present invention, refers to a path with the smallest weight or the smallest weight and the smallest weight from one node to other nodes in a weighted directed graph, that is, a path with the shortest length.
In an embodiment, the number of internal systems of the bank is large, and each bank system needs to establish a certain connection relationship when needed, so that the bank systems can be abstracted into nodes to establish the weighted directed graph, wherein the weighted directed graph comprises the nodes and arcs between the nodes, the nodes represent the bank systems, and the arcs represent the connection relationships between the bank systems.
In an embodiment, since the weighted directed graph includes a plurality of nodes, when determining the shortest path between systems, it is first necessary to determine an initial point, that is, a request system, and it may adopt that one node in the weighted directed graph is set as the initial point, and other nodes are set as the end points, and the shortest path between the initial point and each end point is determined.
In an embodiment, after the shortest path from one node to each destination is determined, a new node in the weighted directed graph needs to be replaced, then the shortest path from the newly replaced node to each destination is obtained, then the remaining nodes are continuously replaced, and the shortest path from each node in the weighted directed graph is repeatedly obtained, so as to obtain the shortest path between systems.
In order to establish the foregoing weighted directed graph, in an embodiment, the foregoing determining the weighted directed graph according to a connection relationship between systems includes: determining a system as nodes, and determining the number of the nodes according to the number of the system; establishing arcs among nodes according to the connection relation of the system, and determining a directed graph; and setting the weight of each arc according to the connection factors and the proportion thereof, and determining the weighted directed graph. In the embodiment, in order to quickly establish the connection relationship between systems and obtain the shortest path between the systems, the bank systems can be abstracted into nodes, the number of the bank systems is determined as the number of the nodes, then arcs between the nodes are established according to the connection relationship between the systems, and a directed graph is determined; the directed graph is a graph including nodes and connecting arcs between the nodes, the arcs between the nodes are directed, and in the embodiment, the arcs between the nodes are vector arcs with directions from the starting point to the ending point. Then setting the weight of each arc according to the connection factors between the systems and the proportion of the connection factors, and determining a weighted directed graph; in the embodiment, the arcs with the directions are set with weights according to the connection factors and the proportion of the arcs with the directions, and a weighted directed graph is established.
In one embodiment, the shortest path is an arc with the smallest weight or an arc with the smallest sum of weights between nodes; the aforementioned coupling factors include at least: average response time of sending requests among nodes, reconstruction difficulty of connection establishment and priority of connection establishment; the sum of the specific gravities of all the connection factors is 1.
As shown in fig. 2, an example schematic diagram of a weighted directed graph of a method for determining a shortest path between systems according to an embodiment of the present invention is shown, where an example of the embodiment of the present invention includes five bank systems, the five bank systems are abstracted to A, B, C, D, E five nodes, an arc is established according to a connection relationship between the systems, a weight of the arc is set, and a weighted directed graph is established, which specifically includes:
network connection exists between the node A and the node B, C, D, the node A is a requester, the node B, C, D is a server, and according to needs, connection factors considered for establishing transaction are assumed to be a set V (V1, V2, V3,. once, vn), and the set of proportion occupied by each connection factor is as follows: h1(H1, H2, H3,., hn), H1+ H2+ H3+, + hn 1; the weights of the three arcs are LAB, LAC and LAD respectively;
for example:
v1, which represents the average time of the transaction from the initial point request of the arc to the receiving terminal point response, i.e. the average response time of the request sent between the nodes, for example, if the values of A and B are 50ms, the values of A to C are 60, and the values of A to D are 80;
v2, the reconstruction difficulty of the connection is established, if the total value is 100, the value from A to B is 40, the value from A to C is 50, the value from A to D is 50, the larger the numerical value is, the more difficult the reconstruction is;
v 3: according to different product plans or positioning, the priority of establishing connection is set, for example, the total value is 10, the value from A to B is 4, the value from A to C is 6, the value from A to D is 4, and the smaller the value is, the higher the priority is.
Assuming that the proportion of v1, v2 and v3 is 20%, 30% and 50%, respectively, the larger the proportion, the more preference degree considered when establishing transaction connection.
The weight LAB from node a to node B is 50 × 20% +40 × 30% +4 × 50% +24
The weight value LAC from node a to node C is 60 × 20% +50 × 30% +6 × 50% + 30 ═ 30
The weight from node a to node D is LAD 80 × 20% +50 × 30% +4 × 50% + 33 ═ 20%
Other weights can be obtained according to similar rules, and consideration factors and specific gravity of each initial point can be flexibly selected according to needs. If there is no connection between nodes, the weight is infinite, for example, if there is no connection between a and E, the weight between a and E is infinite, and there is no arc with directivity between B and a, so the weight between B and a is infinite.
In order to obtain the shortest path from the starting point, in an embodiment, setting a node in the aforementioned optionally weighted directed graph as the starting point, taking other nodes as the end points, and determining the shortest path from the starting point to each end point may include: setting a node in the optional weighted directed graph as a starting point, taking other nodes as end points, comparing all arcs from the starting point to each end point, determining the arc with the minimum weight as the current shortest path, and determining the end point corresponding to the current shortest path as the current end point; acquiring weights of arcs from the current end point to other remaining end points, summing the weights with the weight of the current shortest path, taking the arc with the minimum summation value as the path length from the initial point to other remaining end points, comparing the path length with other arcs except the current shortest path in all arcs, updating the arc with the minimum weight to the current shortest path, and updating the end point corresponding to the updated current shortest path to the current end point; and repeatedly updating the current shortest path and the current end point until the current shortest paths from the initial point to all the end points are obtained. In an embodiment, as shown below, obtaining the shortest path may include the following steps:
s1: according to the established weighted directed graph module, randomly selecting one node in the graph from the total node number n as an initial point, taking other points as end points, comparing the sizes of paths from the initial point to the other end points, wherein the arc with the minimum path is the 1 st shortest path, and the end point corresponding to the arc is the first end point;
s2: obtaining paths from the end point of the S1 shortest path to other end points with connection, summing the paths with the shortest path of S1, taking the minimum value as the path length from the initial point to other end points, and comparing the path length with other paths left in S1, wherein the path with the minimum value is the 2 nd shortest transaction path;
s3: repeating the step of S2 n-1 times, and when repeating each time, summing the path size from the end point to other end points obtained last time and the current shortest path, taking the minimum value as the latest path length from the initial point to other end points, then comparing the path lengths from the initial point to all the remaining end points, and taking the minimum value as the latest shortest path and end point until obtaining the shortest paths from the initial point to all the end points.
As shown in fig. 2, an example schematic diagram of a weighted directed graph of a method for determining shortest paths between systems according to an embodiment of the present invention is shown, in an example of the embodiment of the present invention, taking a point a as a starting point, acquiring a shortest path from the point a to each node, including:
(1) LAB is 24, LAC is 30, LAD is 33 and LAE is infinity, wherein LAB is minimum, and then the shortest transaction path from A to B is obtained and is A- - > B;
(2) if LBE is 35, LAB + LBE is 24+35 is 59, LAB + LBE, LAC, LAD and LAE are compared, and LAC is the minimum, the shortest transaction path from A to C is obtained and is A- - > C;
(3) if LCE is 10, LAC + LCE is 30+10 is 40, LAC + LCE, LAB + LBE, LAD and LAE are compared, and LAD is minimum, the shortest transaction path from A to D is obtained as A- - > D;
(4) when LDC is 12 and LDE is 24, LAD + LDC + LCE is 33+12+10 + 55 and LAD + LDE is 33+24 + 57, LAD + LDC + LCE is 55, LAD + LDE is 57, LAC + LCE is 40, and LAB + LBE is 59, LAC + LCE is the smallest, and the shortest transaction path from a to E is a- > C- > E.
After the shortest path from point a to each node is acquired, the start point is changed to B, C, D, E, and the shortest path of each node is repeatedly acquired.
The embodiment of the present invention further provides a computer device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, the processor implements the above method for determining a shortest path between systems.
An embodiment of the present invention further provides a computer-readable storage medium, which stores a computer program for executing the method for determining the shortest path between systems.
The embodiment of the present invention further provides a device for determining a shortest path between systems, as described in the following embodiments. Because the principle of the device for solving the problems is similar to that of a method for determining the shortest path between systems, the implementation of the device can refer to the implementation of the method for determining the shortest path between systems, and repeated details are not repeated.
As shown in fig. 3, an apparatus for determining a shortest path between systems according to an embodiment of the present invention is schematically illustrated, and an apparatus for determining a shortest path between systems according to an embodiment of the present invention includes:
a weighted directed graph determining module 301, configured to determine a weighted directed graph according to a connection relationship between systems, where the weighted directed graph includes: a plurality of nodes and arcs between nodes;
a single-node shortest path determining module 302, configured to set a node in the optional weighted directed graph as a starting point, take other nodes as end points, and determine a shortest path from the starting point to each end point;
and the module 303 for repeatedly obtaining the shortest path of all nodes is used for replacing the starting point of the weighted directed graph and repeatedly obtaining the shortest path of each node in the weighted directed graph.
In one embodiment, the weighted directed graph determining module is specifically configured to:
determining a system as nodes, and determining the number of the nodes according to the number of the system;
establishing arcs among nodes according to the connection relation of the system, and determining a directed graph;
and setting the weight of each arc according to the connection factors and the proportion thereof, and determining the weighted directed graph.
In one embodiment, the shortest path is an arc with the smallest weight or an arc with the smallest sum of weights between nodes.
In one embodiment, the connection factors include at least: average response time of sending requests among nodes, reconstruction difficulty of connection establishment and priority of connection establishment.
In one embodiment, the sum of the specific gravities of all the connection factors is 1.
In one embodiment, the single-node shortest path determining module is specifically configured to:
setting a node in the optional weighted directed graph as a starting point, taking other nodes as end points, comparing all arcs from the starting point to each end point, determining the arc with the minimum weight as the current shortest path, and determining the end point corresponding to the current shortest path as the current end point;
acquiring weights of arcs from the current end point to other remaining end points, summing the weights with the weight of the current shortest path, taking the arc with the minimum summation value as the path length from the initial point to other remaining end points, comparing the path length with other arcs except the current shortest path in all arcs, updating the arc with the minimum weight to the current shortest path, and updating the end point corresponding to the updated current shortest path to the current end point;
and repeatedly updating the current shortest path and the current end point until the current shortest paths from the initial point to all the end points are obtained.
In summary, the method and the device for determining the shortest path provided by the embodiment of the present invention establish a weighted directed graph by using the connection relationship between the bank system and the system, simplify the complex system connection relationship into the weighted directed graph, and truly simulate the connection condition between the system and the system; then, the shortest path can be rapidly solved by utilizing the directed graph, and scientific reference and selection are provided for designing a transaction link between systems. The embodiment of the invention scientifically and reasonably establishes the weighted directed graph model through network connection between an abstract system and a system, truly simulates the connection condition between the system and the system, establishes the mathematical model for the complex connection condition between the systems, thereby analyzing by using mathematical knowledge, flexibly calculating the weight according to different required elements when the system and the system are designed to establish transaction, establishing the weighted directed graph model, scientifically and reasonably calculating the shortest path between the systems, and designing a transaction link between the systems to provide scientific reference and selection; the consideration factors of design transaction consideration are flexibly changed, and a universal method for quickly providing the shortest transaction path between systems can be rapidly provided.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are only exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (14)
1. A method for determining a shortest path between systems, comprising:
determining a weighted directed graph according to the connection relation between systems, wherein the weighted directed graph comprises: a plurality of nodes and arcs between nodes;
setting one node in the optional weighted directed graph as a starting point, taking other nodes as end points, and determining the shortest path from the starting point to each end point;
and changing the initial point of the weighted directed graph, and repeatedly obtaining the shortest path of each node in the weighted directed graph.
2. The method of claim 1, wherein determining a weighted directed graph based on the connection relationships between systems comprises:
determining a system as nodes, and determining the number of the nodes according to the number of the system;
establishing arcs among nodes according to the connection relation of the system, and determining a directed graph;
and setting the weight of each arc according to the connection factors and the proportion thereof, and determining the weighted directed graph.
3. The method of claim 2, wherein the shortest path is an arc with a minimum weight or a minimum sum of weights between nodes.
4. The method of claim 2, wherein the connection factors include at least: average response time of sending requests among nodes, reconstruction difficulty of establishing connection and priority of establishing connection.
5. The method of claim 2, wherein the sum of the specific gravities of all the connection factors is 1.
6. The method of claim 2, wherein the step of determining the shortest path from a starting point to each end point by using one node in the optionally weighted directed graph as the starting point and the other nodes as the end points comprises:
setting a node in the optional weighted directed graph as a starting point, taking other nodes as end points, comparing all arcs from the starting point to each end point, determining the arc with the minimum weight as the current shortest path, and determining the end point corresponding to the current shortest path as the current end point;
acquiring weights of arcs from the current end point to other remaining end points, summing the weights with the weight of the current shortest path, taking the arc with the minimum summation value as the path length from the initial point to other remaining end points, comparing the path length with other arcs except the current shortest path in all arcs, updating the arc with the minimum weight to the current shortest path, and updating the end point corresponding to the updated current shortest path to the current end point;
and repeatedly updating the current shortest path and the current end point until the current shortest paths from the initial point to all the end points are obtained.
7. An apparatus for determining a shortest path between systems, comprising:
the determination module of the weighted directed graph is used for determining the weighted directed graph according to the connection relation between systems, and the weighted directed graph comprises: a plurality of nodes and arcs between nodes;
the single-node shortest path determining module is used for setting one node in the optional weighted directed graph as a starting point, taking other nodes as end points and determining the shortest path from the starting point to each end point;
and the module for repeatedly calculating the shortest paths of all the nodes is used for replacing the initial point of the weighted directed graph and repeatedly calculating the shortest path of each node in the weighted directed graph.
8. The apparatus of claim 7, wherein the weighted directed graph determination module is specifically configured to:
determining a system as nodes, and determining the number of the nodes according to the number of the system;
establishing arcs among nodes according to the connection relation of the system, and determining a directed graph;
and setting the weight of each arc according to the connection factors and the proportion thereof, and determining the weighted directed graph.
9. The apparatus of claim 8, in which the shortest path is an arc with a smallest weight or an arc with a smallest sum of weights between nodes.
10. The apparatus of claim 8, wherein the connection factors include at least: average response time of sending requests among nodes, reconstruction difficulty of connection establishment and priority of connection establishment.
11. The apparatus of claim 8, wherein the sum of the specific gravities of all the connection factors is 1.
12. The apparatus of claim 8, wherein the single node shortest path determining module is specifically configured to:
setting a node in the optional weighted directed graph as a starting point, taking other nodes as end points, comparing all arcs from the starting point to each end point, determining the arc with the minimum weight as the current shortest path, and determining the end point corresponding to the current shortest path as the current end point;
acquiring weights of arcs from the current end point to other remaining end points, summing the weights with the weight of the current shortest path, taking the arc with the minimum summation value as the path length from the initial point to other remaining end points, comparing the path length with other arcs except the current shortest path in all arcs, updating the arc with the minimum weight to the current shortest path, and updating the end point corresponding to the updated current shortest path to the current end point;
and repeatedly updating the current shortest path and the current end point until the current shortest paths from the initial point to all the end points are obtained.
13. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing a method of determining shortest paths between systems as claimed in any one of claims 1 to 6 when executing the computer program.
14. A computer-readable storage medium storing a computer program for executing a method of determining a shortest path between systems according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911189256.0A CN110958178A (en) | 2019-11-28 | 2019-11-28 | Method and device for determining shortest path between systems |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911189256.0A CN110958178A (en) | 2019-11-28 | 2019-11-28 | Method and device for determining shortest path between systems |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110958178A true CN110958178A (en) | 2020-04-03 |
Family
ID=69978747
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911189256.0A Pending CN110958178A (en) | 2019-11-28 | 2019-11-28 | Method and device for determining shortest path between systems |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110958178A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111553790A (en) * | 2020-04-29 | 2020-08-18 | 支付宝实验室(新加坡)有限公司 | Cross-border remittance method and device and electronic equipment |
| CN117252314A (en) * | 2023-08-22 | 2023-12-19 | 杭州万澜科技有限公司 | Experimental planning method and system based on optimal path |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108694667A (en) * | 2018-05-24 | 2018-10-23 | 中国建设银行股份有限公司 | A kind of user property value calculating method and device |
| CN110097350A (en) * | 2019-04-19 | 2019-08-06 | 上海瀚银信息技术有限公司 | A kind of transaction data mediating transmission system |
-
2019
- 2019-11-28 CN CN201911189256.0A patent/CN110958178A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108694667A (en) * | 2018-05-24 | 2018-10-23 | 中国建设银行股份有限公司 | A kind of user property value calculating method and device |
| CN110097350A (en) * | 2019-04-19 | 2019-08-06 | 上海瀚银信息技术有限公司 | A kind of transaction data mediating transmission system |
Non-Patent Citations (2)
| Title |
|---|
| 巴曙松等: "中国银行间支付网络及其结构特征", 《系统工程》 * |
| 胡世煌: "基于OpenFlow网络的路由技术研究", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111553790A (en) * | 2020-04-29 | 2020-08-18 | 支付宝实验室(新加坡)有限公司 | Cross-border remittance method and device and electronic equipment |
| WO2021218827A1 (en) * | 2020-04-29 | 2021-11-04 | 支付宝实验室(新加坡)有限公司 | Cross-border remittance |
| CN117252314A (en) * | 2023-08-22 | 2023-12-19 | 杭州万澜科技有限公司 | Experimental planning method and system based on optimal path |
| CN117252314B (en) * | 2023-08-22 | 2024-04-02 | 杭州万澜科技有限公司 | Experimental planning method and system based on optimal path |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113168569A (en) | Decentralized distributed deep learning | |
| JP2018533792A (en) | Calculation graph correction | |
| CN110807515A (en) | Model generation method and device | |
| KR20190086134A (en) | Method and apparatus for selecting optiaml training model from various tarining models included in neural network | |
| US9705773B2 (en) | Parallelized network traffic flow availability simulation using stochastic process and traffic engineering algorithms | |
| JP6975866B2 (en) | Methods and systems for flexible pipeline generation | |
| CN110958178A (en) | Method and device for determining shortest path between systems | |
| CN110347593A (en) | Flow testing method and device | |
| CN111368973A (en) | Method and apparatus for training a hyper-network | |
| CN109413202A (en) | The ordering system and method for block chain Transaction Information | |
| CN109542779A (en) | Test method, device and storage medium | |
| CN113689270B (en) | Method for determining black product device, electronic device, storage medium, and program product | |
| Fanjiang et al. | Time series QoS forecasting for Web services using multi-predictor-based genetic programming | |
| CN111951112A (en) | Intelligent contract execution method based on block chain, terminal equipment and storage medium | |
| CN110413287A (en) | The dispositions method and device of software | |
| CN110489090A (en) | A kind of applied software development method and system based on application model | |
| CN110752964A (en) | Network equipment testing method and device | |
| CN110609744A (en) | Method, apparatus and computer program product for processing computing tasks | |
| CN108520025B (en) | Service node determination method, device, equipment and medium | |
| CN112799797A (en) | Task management method and device | |
| US10771329B1 (en) | Automated service tuning | |
| JP6183359B2 (en) | Design support apparatus, design support method, and program | |
| CN111435938B (en) | Data request processing method, device and equipment | |
| CN113691311B (en) | Fault positioning method of optical network, electronic equipment and computer readable storage medium | |
| CN110633707A (en) | Method and device for predicting speed |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200403 |