Mutual exclusion path calculation method and device and storage medium

Abstract

The invention discloses a mutual exclusion path calculation method and device and a storage medium, relates to the technical field of power operation and maintenance, and is used for improving the efficiency and reliability of calculating a mutual exclusion path by electronic equipment. The method comprises the steps that a first shortest path between a source node and a destination node is obtained, the first shortest path comprises M intermediate nodes, and M is larger than or equal to 0; on the basis of the source node and the M intermediate nodes, M + 1 alternative paths are obtained through calculation, and each of the source node and the M intermediate nodes corresponds to one alternative path; under the condition that the path mutually exclusive to the first shortest path exists in the M + 1 alternative paths, determining the first shortest path and the first alternative path mutually exclusive to the first shortest path as two mutually exclusive paths; or under the condition that the path mutually exclusive to the first shortest path does not exist in the M + 1 alternative paths, two mutually exclusive paths are determined based on a second alternative path, and the second alternative path is the shortest path in the M + 1 alternative paths.

Description

Technical Field

[0001] The present application relates to the field of power operation and maintenance, and in particular to a mutually exclusive path calculation method, device and storage medium. Background Art

[0002] In the field of network communications, in order to reduce the losses caused by data loss, a variety of protection strategies are used to improve the survivability of the network, among which the need to find two mutually exclusive paths is particularly important. Mutually exclusive paths refer to two paths that have no common nodes, which can be used to implement redundant paths, load balancing, fault tolerance and other application scenarios.

[0003] At present, the commonly used path search algorithms are Depth First Search (DFS) and Breadth First Search (BFS) algorithms, but these two algorithms need to calculate all path possibilities in the topological network and then find two mutually exclusive paths. When the topological network of the electronic device is too large, the efficiency of calculating mutually exclusive paths will be low. In addition, the "cutting successive shortest path" algorithm can also be used. First, a shortest path is calculated as a working path, and then all links belonging to the working path are deleted from the network topology map. Finally, a shortest path is calculated on the pruned network topology as a protection path, that is, the calculated working path and protection path are used as two mutually exclusive paths, but the protection path may not be found in the pruned network topology.

[0004] In summary, the efficiency and reliability of electronic devices in calculating mutually exclusive paths are low. Summary of the invention

[0005] The present application provides a mutually exclusive path calculation method, device and storage medium, which are used to improve the efficiency and reliability of electronic equipment in calculating mutually exclusive paths.

[0006] In order to achieve the above objectives, this application adopts the following technical solutions:

[0007] In a first aspect, a mutually exclusive path calculation method is provided, which is applied to an electronic device, and the method includes: obtaining a first shortest path between a source node and a destination node, the first shortest path including M intermediate nodes, M≥0; based on the source node and the M intermediate nodes, calculating M+1 alternative paths, the source node and each of the M intermediate nodes corresponding to an alternative path respectively; in the case that there is a path mutually exclusive with the first shortest path among the M+1 alternative paths, the first shortest path and the first alternative path mutually exclusive with the first shortest path are determined as two mutually exclusive paths; or, in the case that there is no path mutually exclusive with the first shortest path among the M+1 alternative paths, two mutually exclusive paths are determined based on the second alternative path, and the second alternative path is the shortest path among the M+1 alternative paths.

[0008] Based on the above mutually exclusive path calculation method, after the electronic device obtains M+1 candidate paths based on the source node and the M intermediate nodes of the first shortest path, the electronic device can determine the mutually exclusive path corresponding to the first shortest path from the M+1 candidate paths; and when there is no mutually exclusive path corresponding to the first shortest path in the M+1 candidate paths, the electronic device can continue to match two mutually exclusive paths based on the shortest path in the M+1 candidate paths, without traversing all paths from each node to the destination node, and avoiding the problem of not being able to find two mutually exclusive paths. Therefore, the present application improves the efficiency of calculating mutually exclusive paths while also improving the reliability of calculating mutually exclusive paths.

[0009] In one possible implementation, the above-mentioned method of "calculating M+1 alternative paths based on the source node and M intermediate nodes" includes: for the source node and any node among the M intermediate nodes, taking any node as a deviation point, calculating the second shortest path between any node and the destination node; based on the second shortest path and the third shortest path from the source node to any node, calculating the alternative path corresponding to any node.

[0010] In a possible implementation, before the above-mentioned "when there is a path that is mutually exclusive with the first shortest path in the M+1 alternative paths, the first shortest path and the first alternative path that is mutually exclusive with the first shortest path are determined as two mutually exclusive paths", the mutually exclusive path calculation method also includes: matching the first shortest path with the M+1 alternative paths in pairs, and when the first alternative path in the M+1 alternative paths does not contain the same intermediate nodes as the first shortest path, determining that there is a path that is mutually exclusive with the first shortest path in the M+1 alternative paths.

[0011] In one possible implementation, the above-mentioned method of "when there is a path mutually exclusive with the first shortest path among the M+1 alternative paths, determining the first shortest path and the first alternative path mutually exclusive with the first shortest path as two mutually exclusive paths" includes: when there is a path mutually exclusive with the first shortest path among the M+1 alternative paths, obtaining the cost of the first shortest path and the cost of the first alternative path; when the difference between the cost of the first shortest path and the cost of the first alternative path is less than a preset threshold, determining the first shortest path and the first alternative path as two mutually exclusive paths.

[0012] In one possible implementation, the above-mentioned method of "determining two mutually exclusive paths based on the second alternative path" includes: based on the source node and the N intermediate nodes of the second alternative path, obtaining N+1 alternative paths, the source node and each of the N intermediate nodes corresponding to an alternative path respectively; N is a positive integer; the first subpath and the second subpath in the first path set are determined as two mutually exclusive paths; wherein the first path set includes: N+1 alternative paths, the second alternative path and the first shortest path; the first subpath and the second subpath do not contain the same intermediate nodes.

[0013] In a second aspect, a mutually exclusive path calculation device is provided, which is applied to an electronic device, and can also be a functional module in the electronic device for implementing the method described in the first aspect or any possible design of the first aspect. The mutually exclusive path calculation device can implement the functions performed by the electronic device in the above aspects or possible designs, and the functions can be implemented by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions. For example, the mutually exclusive path calculation device includes an acquisition unit, a calculation unit, and a determination unit.

[0014] The acquisition unit is used to acquire a first shortest path from a source node to a destination node, where the first shortest path includes M intermediate nodes, where M≥0.

[0015] The calculation unit is used to calculate M+1 candidate paths based on the source node and the M intermediate nodes included in the first shortest path obtained by the acquisition unit, and the source node and each of the M intermediate nodes correspond to one candidate path respectively.

[0016] Identify units for:

[0017] In the case that there is a path mutually exclusive with the first shortest path among the M+1 candidate paths, the first shortest path and the first candidate path mutually exclusive with the first shortest path are determined as two mutually exclusive paths; or,

[0018] When there is no mutually exclusive path with the first shortest path among the M+1 candidate paths, two mutually exclusive paths are determined based on the second candidate path, and the second candidate path is the shortest path among the M+1 candidate paths.

[0019] The specific implementation of the mutually exclusive path calculation device can refer to the behavior function of the electronic device in the mutually exclusive path calculation method provided by the first aspect or any possible design of the first aspect, and will not be repeated here. Therefore, the provided mutually exclusive path calculation device can achieve the same beneficial effects as the first aspect or any possible design of the first aspect.

[0020] In one possible implementation, the above-mentioned computing unit is specifically used to calculate the second shortest path between any node and the destination node for the source node and any node among the M intermediate nodes, taking any node as a deviation point; and based on the second shortest path and the third shortest path from the source node to any node, calculate the alternative path corresponding to any node.

[0021] In one possible implementation, the determination unit is further used to, when there is a path mutually exclusive with the first shortest path among the M+1 alternative paths, match the first shortest path with the M+1 alternative paths in pairs before determining the first shortest path and the first alternative path mutually exclusive with the first shortest path as two mutually exclusive paths; and, when the first alternative path among the M+1 alternative paths does not contain the same intermediate nodes as the first shortest path, determine that there is a path mutually exclusive with the first shortest path among the M+1 alternative paths.

[0022] In a possible implementation, the acquisition unit is further used to acquire the cost of the first shortest path and the cost of the first candidate path when there is a path mutually exclusive with the first shortest path among the M+1 candidate paths. The determination unit is specifically used to determine the first shortest path and the first candidate path as two mutually exclusive paths when the difference between the cost of the first shortest path acquired by the acquisition unit and the cost of the first candidate path is less than a preset threshold.

[0023] In a possible implementation, the acquisition unit is further used to acquire N+1 candidate paths based on the source node and the N intermediate nodes of the second candidate path, where the source node and each of the N intermediate nodes correspond to an alternative path; N is a positive integer. The determination unit is specifically used to determine the first subpath and the second subpath in the first path set as two mutually exclusive paths; wherein the first path set includes: N+1 candidate paths, the second candidate path and the first shortest path; the first subpath and the second subpath do not contain the same intermediate nodes.

[0024] In a third aspect, a mutually exclusive path calculation device is provided, which may be an electronic device or a chip or system on chip in an electronic device. The mutually exclusive path calculation device may implement the functions performed by the electronic device in the above aspects or possible designs, and the functions may be implemented by hardware, such as: in one possible design, the mutually exclusive path calculation device may include: a processor and a communication interface, and the processor may be used to support the mutually exclusive path calculation device to implement the functions involved in the above first aspect or any possible design of the first aspect, for example: the processor calculates M+1 alternative paths based on the source node and the M intermediate nodes included in the first shortest path.

[0025] In another possible design, the mutually exclusive path calculation device may further include a memory, the memory being used to store computer-executable instructions and data necessary for the mutually exclusive path calculation device. When the mutually exclusive path calculation device is running, the processor executes the computer-executable instructions stored in the memory, so that the mutually exclusive path calculation device performs the mutually exclusive path calculation method described in the first aspect or any possible design of the first aspect.

[0026] In a fourth aspect, a mutually exclusive path calculation device is provided, which may be a mutually exclusive path calculation device or a chip or system on chip in a mutually exclusive path calculation device. The mutually exclusive path calculation device may implement the functions performed by the mutually exclusive path calculation device in the above aspects or possible designs, and the functions may be implemented by hardware, such as: in one possible design, the mutually exclusive path calculation device may include: a processor and a communication interface, and the processor may be used to support the mutually exclusive path calculation device to implement the functions involved in the above first aspect or any possible design of the first aspect, for example: the processor calculates M+1 alternative paths based on the source node and the M intermediate nodes included in the first shortest path.

[0027] In another possible design, the mutually exclusive path calculation device may further include a memory, the memory being used to store computer-executable instructions and data necessary for the mutually exclusive path calculation device. When the mutually exclusive path calculation device is running, the processor executes the computer-executable instructions stored in the memory, so that the mutually exclusive path calculation device performs the mutually exclusive path calculation method described in the first aspect or any possible design of the first aspect.

[0028] In a fifth aspect, a computer-readable storage medium is provided, which may be a readable non-volatile storage medium, and which stores computer instructions or programs. When the computer-readable storage medium is run on a computer, the computer can execute the mutually exclusive path calculation method described in the first aspect or any possible design of the above aspects.

[0029] In a sixth aspect, a computer program product comprising instructions is provided, which, when executed on a computer, enables the computer to execute the mutually exclusive path calculation method described in the first aspect or any possible design of the above aspects.

[0030] In a seventh aspect, a mutually exclusive path calculation device is provided, which may be a mutually exclusive path calculation device or a chip or system on chip in a mutually exclusive path calculation device, and the mutually exclusive path calculation device includes one or more processors and one or more memories. The one or more memories are coupled to the one or more processors, and the one or more memories are used to store computer program codes, and the computer program codes include computer instructions, and when the one or more processors execute the computer instructions, the mutually exclusive path calculation device performs the mutually exclusive path calculation method described in the first aspect or any possible design of the first aspect.

[0031] In an eighth aspect, a chip system is provided, the chip system including a processor and a communication interface, the chip system can be used to implement the functions performed by the mutually exclusive path calculation device in the above-mentioned first aspect or any possible design of the first aspect, for example, the processor is used to calculate M+1 alternative paths based on the source node and the M intermediate nodes included in the first shortest path. In one possible design, the chip system also includes a memory, and the memory is used to store program instructions and / or data. The chip system can be composed of a chip, and can also include a chip and other discrete devices, without limitation.

[0032] Among them, the technical effects brought about by any design method from the second aspect to the eighth aspect can refer to the technical effects brought about by the above-mentioned first aspect, and will not be repeated here. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] Figure 1 One of the flowcharts of a mutually exclusive path calculation method provided in an embodiment of the present application;

[0034] Figure 2 A second flowchart of a mutually exclusive path calculation method provided in an embodiment of the present application;

[0035] Figure 3 A schematic diagram of a topological structure provided in an embodiment of the present application;

[0036] Figure 4 A schematic diagram of the structure of a mutually exclusive path calculation device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0037] In order to enable ordinary persons in the art to better understand the technical solutions of the present disclosure, the technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the accompanying drawings.

[0038] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present disclosure described herein can be implemented in an order other than those illustrated or described herein. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure. Instead, they are merely examples of devices and methods consistent with some aspects of the embodiments of the present application as detailed in the attached claims.

[0039] It should also be understood that the term “comprising” indicates the presence of described features, integers, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, integers, steps, operations, elements and / or components.

[0040] As mentioned in the background technology, in the field of network communication and path calculation, the interruption of a fiber span or the failure of a node device in long-distance information transmission will cause a large number of service interruptions and data loss in the communication network, which is unacceptable to network users. In order to reduce the losses caused by data loss, a variety of protection strategies are used to improve the survivability of the network, among which the need to find two mutually exclusive paths is particularly important. Mutually exclusive paths refer to two paths that have no common nodes, which can be used to implement redundant paths, load balancing, fault tolerance and other application scenarios.

[0041] Current path calculation technology mainly relies on the Dijkstra algorithm to find the shortest path. The Dijkstra algorithm is a classic single-source shortest path algorithm that determines the shortest path by calculating the edge weights between nodes. However, the Dijkstra algorithm cannot directly calculate two mutually exclusive paths, but can only calculate one shortest path. This is because the Dijkstra algorithm is based on a greedy strategy, and each time it selects the node with the shortest current distance for expansion, it cannot consider multiple paths at the same time.

[0042] In addition, DFS and BFS are also commonly used path search algorithms, but they are not suitable for calculating mutually exclusive paths. The DFS algorithm will go deep along a path until it can no longer be expanded, and then go back to the previous node to search for other paths. The BFS algorithm searches in hierarchical order, first expanding all neighbor nodes of the current node, and then expanding the neighbor nodes of the neighbor nodes. Since both the DFS and BFS algorithms are expanded layer by layer, it is necessary to calculate all path possibilities in the topological network and then find two mutually exclusive paths. When the topological network of the electronic device is too large, the efficiency of calculating mutually exclusive paths will be low. In addition, the "cutting successive shortest path" algorithm can also be used. First, a shortest path is calculated as a working path, and then all links belonging to the working path are deleted from the network topology map. Finally, a shortest path is calculated on the pruned network topology as a protection path, that is, the calculated working path and protection path are used as two mutually exclusive paths, but the protection path may not be found in the pruned network topology. In summary, the efficiency and reliability of electronic devices in calculating mutually exclusive paths are low.

[0043] In view of this, an embodiment of the present application provides a mutually exclusive path calculation method for improving the efficiency and reliability of electronic devices calculating mutually exclusive paths. The method includes: obtaining a first shortest path from a source node to a destination node, the first shortest path including M intermediate nodes, M≥0; based on the source node and the M intermediate nodes, calculating M+1 alternative paths, the source node and each of the M intermediate nodes corresponding to an alternative path; in the case where there is a path mutually exclusive with the first shortest path in the M+1 alternative paths, the first shortest path and the first alternative path mutually exclusive with the first shortest path are determined as two mutually exclusive paths; or, in the case where there is no path mutually exclusive with the first shortest path in the M+1 alternative paths, based on the second alternative path, two mutually exclusive paths are determined, and the second alternative path is the shortest path among the M+1 alternative paths.

[0044] Based on the above scheme, after the electronic device obtains M+1 candidate paths based on the source node and the M intermediate nodes of the first shortest path, the electronic device can determine the mutually exclusive path corresponding to the first shortest path from the M+1 candidate paths; and when there is no mutually exclusive path corresponding to the first shortest path in the M+1 candidate paths, the electronic device can continue to match two mutually exclusive paths based on the shortest path in the M+1 candidate paths, without traversing all paths from each node to the destination node, and avoiding the problem of not being able to find two mutually exclusive paths. Therefore, the present application improves the efficiency of calculating mutually exclusive paths while also improving the reliability of calculating mutually exclusive paths.

[0045] The method provided in the embodiment of the present application is described in detail below with reference to the accompanying drawings.

[0046] The present application embodiment provides a mutually exclusive path calculation method. Figure 1 As shown, the method may include S101-S103, or include S101, S102 and S104:

[0047] S101. The electronic device obtains a first shortest path from a source node to a destination node.

[0048] The first shortest path includes M intermediate nodes, where M≥0.

[0049] In a possible implementation, the electronic device may calculate the first shortest path from the source node to the destination node by using the Dijkstra algorithm.

[0050] It should be noted that for the detailed steps of the electronic device calculating the first shortest path between the source node and the destination node through the Dijkstra algorithm, please refer to the description of the electronic device calculating the shortest path between the source node and the destination node through the Dijkstra algorithm in the related art, which will not be repeated here.

[0051] S102: The electronic device calculates M+1 candidate paths based on the source node and M intermediate nodes.

[0052] The source node and each of the M intermediate nodes correspond to an alternative path respectively.

[0053] It can be understood that the electronic device can calculate an alternative path corresponding to the source node and an alternative path corresponding to each of the M intermediate nodes.

[0054] In one possible implementation, the electronic device calculates M+1 alternative paths based on the source node and M intermediate nodes. This can also be understood as: the electronic device can calculate M+1 alternative paths based on the nodes in the first shortest path except the destination node.

[0055] In some embodiments, the above S102 may be implemented specifically through the following S102a and S102b:

[0056] S102a: For the source node and any node among the M intermediate nodes, the electronic device takes any node as a deviation point and calculates the second shortest path from any node to the destination node.

[0057] In a possible implementation, the electronic device may calculate the second shortest path from any node to the destination node by using the Dijkstra algorithm.

[0058] S102b: The electronic device calculates an alternative path corresponding to any node based on the second shortest path and the third shortest path from the source node to any node.

[0059] Specifically, the electronic device can take the source node and each of the M intermediate nodes as a deviation point, and then traverse each deviation point. For each deviation point, it finds the shortest path from the deviation point to the destination node, and then calculates the shortest path corresponding to the deviation point based on the shortest path from the deviation point to the destination node and the shortest path from the source node to the deviation point.

[0060] In a possible implementation manner, the electronic device may combine the second shortest path and the third shortest path to obtain an alternative path corresponding to any node.

[0061] For example: the second shortest path is "0-1-6", the third shortest path is "6-5", and the electronic device can obtain the alternative path corresponding to any node as "0-1-6-5".

[0062] In a possible implementation, for any node, if the electronic device calculates two candidate paths and the costs of the two candidate paths are the same, the electronic device can select any one path as the candidate path corresponding to any node.

[0063] S103: When there is a path mutually exclusive with the first shortest path among the M+1 candidate paths, the electronic device determines the first shortest path and the first candidate path mutually exclusive with the first shortest path as two mutually exclusive paths.

[0064] In a possible implementation, the path mutually exclusive with the first shortest path may be understood as a path that does not have the same intermediate nodes as the first shortest path, or may be understood as a path that does not share nodes with the first shortest path.

[0065] In a possible implementation manner, the electronic device determining the first shortest path and the first candidate path as two mutually exclusive paths can be understood as: determining the first shortest path as the main path, and determining the first candidate path as the backup path.

[0066] In a possible implementation manner, the electronic device determining the first shortest path and the first candidate path as two mutually exclusive paths can be understood as: determining the first shortest path as a working path, and determining the first candidate path as a protection path.

[0067] In one possible implementation, when there are at least two paths among the M+1 alternative paths that are mutually exclusive with the first shortest path, the electronic device may use the shortest path among the at least two paths as the first alternative path, and then determine the first shortest path and the first alternative path as two mutually exclusive paths.

[0068] In another possible implementation, when there are at least two paths among the M+1 alternative paths that are mutually exclusive with the first shortest path, and there are two shortest paths, the electronic device can use any one of the two shortest paths as the first alternative path, and then determine the first shortest path and the first alternative path as two mutually exclusive paths.

[0069] In a possible implementation, the two mutually exclusive paths may also be referred to as separate dual paths.

[0070] In some examples, for example, there are a path P1 and a path P2. If P1 and P2 do not pass through the same node except the source node and the destination node, P1 and P2 are called separate dual paths.

[0071] In some embodiments, before the above S103, the mutually exclusive path calculation method provided in the embodiment of the present application further includes the following S201:

[0072] S201. Match the first shortest path with the M+1 candidate paths in pairs. When the first candidate path in the M+1 candidate paths does not contain the same intermediate nodes as the first shortest path, the electronic device determines that there is a path in the M+1 candidate paths that is mutually exclusive with the first shortest path.

[0073] It can be understood that the electronic device can compare the first shortest path with each alternative path in the M+1 alternative paths. When the intermediate nodes of the first alternative path in the M+1 alternative paths are different from the intermediate nodes of the first shortest path, the electronic device can determine that there is a path in the M+1 alternative paths that is mutually exclusive with the first shortest path, and can determine the first shortest path and the first alternative path in the M+1 alternative paths that is mutually exclusive with the first shortest path as two mutually exclusive paths.

[0074] For example, when the first shortest path is "0-1-3-5" and the M+1 candidate paths are "0-2-4-5", "0-1-4-5" and "0-1-3-4-5", the electronic device may match the first shortest path "0-1-3-5" with the path "0-2-4-5", match the first shortest path "0-1-3-5" with the path "0-1-4-5", and match the first shortest path "0-1-3-5" with the path "0-1-4-5". After matching with the path "0-1-3-4-5", the electronic device can know that the first shortest path "0-1-3-5" and the path "0-2-4-5" do not contain the same intermediate nodes, so the electronic device can determine that there is a path that is mutually exclusive with the first shortest path "0-1-3-5" among the M+1 alternative paths, and can determine the first shortest path "0-1-3-5" and the path "0-2-4-5" as two mutually exclusive paths.

[0075] In some embodiments, the above S103 may be implemented specifically through the following S103a and S103b:

[0076] S103a: When there is a path that is mutually exclusive with the first shortest path among the M+1 candidate paths, the electronic device obtains a cost of the first shortest path and a cost of the first candidate path.

[0077] In a possible implementation, the cost of a path may be understood as the weight of the path (ie, the distance).

[0078] S103b: When the difference between the cost of the first shortest path and the cost of the first candidate path is less than a preset threshold, the electronic device determines the first shortest path and the first candidate path as two mutually exclusive paths.

[0079] In a possible implementation, the preset threshold may be represented by disparity, which may be determined based on actual usage requirements and is not limited in the present application.

[0080] For example: the first shortest path is P1, and the cost of the first shortest path is P1d; the first alternative path is P2, and the cost of the first alternative path is P2d; when |P1d–P2d|≤disparity, the electronic device can determine the first shortest path and the first alternative path as two mutually exclusive paths.

[0081] Based on the above technical solution, after the electronic device obtains the first shortest path, it obtains M+1 alternative paths based on the source node and the M intermediate nodes of the first shortest path, and then determines the mutually exclusive path corresponding to the first shortest path from the M+1 alternative paths. Therefore, it is not necessary to traverse all paths from each node to the destination node, thereby improving the efficiency of the electronic device in calculating mutually exclusive paths.

[0082] S104: When there is no mutually exclusive path with the first shortest path among the M+1 candidate paths, the electronic device determines two mutually exclusive paths based on the second candidate path, and the second candidate path is the shortest path among the M+1 candidate paths.

[0083] In one possible implementation, the electronic device may match the first shortest path with the M+1 alternative paths in pairs. When each of the M+1 alternative paths contains the same intermediate nodes as the first shortest path, the electronic device may determine that there is no path in the M+1 alternative paths that is mutually exclusive with the first shortest path.

[0084] For example, when the first shortest path is "0-1-3-5" and the M+1 candidate paths are "0-1-6-3-5", "0-1-4-5" and "0-1-3-4-5", the electronic device may match the first shortest path "0-1-3-5" with the path "0-1-6-3-5", the first shortest path "0-1-3-5" with the path "0-1-4-5", and the first shortest path "0-1-3-5" with the path "0-1-3-4-5". After the matching is completed, the electronic device can know that the first shortest path "0-1-3-5" and the paths "0-1-6-3-5", "0-1-4-5" and "0-1-3-4-5" all contain the same intermediate nodes, so the electronic device can determine that there is no path in the M+1 alternative paths that is mutually exclusive with the first shortest path "0-1-3-5", so the electronic device can determine two mutually exclusive paths based on the shortest path "0-1-4-5" among the M+1 alternative paths (that is, the second alternative path mentioned above).

[0085] In a possible implementation, when there is no path in the M+1 candidate paths that is mutually exclusive with the first shortest path, the electronic device may first determine a shortest path from the M+1 candidate paths, and then determine two mutually exclusive paths based on the shortest path.

[0086] In a possible implementation, the electronic device may determine the shortest path (ie, the second candidate path mentioned above) from the M+1 candidate paths by using the Dijkstra algorithm.

[0087] In a possible implementation, when there are two shortest paths among the M+1 candidate paths, the electronic device may use any one of the two shortest paths as the second candidate path.

[0088] In some embodiments, the “the electronic device determines two mutually exclusive paths based on the second candidate path” in the above S104 can be specifically implemented by the following S104a and S104b:

[0089] S104a: The electronic device obtains N+1 candidate paths based on the source node and the N intermediate nodes of the second candidate path.

[0090] The source node and each of the N intermediate nodes correspond to an alternative path respectively; N is a positive integer.

[0091] In one possible implementation, the electronic device calculates N+1 alternative paths based on the source node and N intermediate nodes, which can also be understood as: the electronic device can calculate N+1 alternative paths based on the nodes in the second alternative path except the destination node.

[0092] In one possible implementation, for any node among the source node and the N intermediate nodes of the second alternative path, the electronic device can use any node as a deviation point to calculate the fourth shortest path between any node and the destination node, and then the electronic device can calculate the alternative path corresponding to any node based on the fourth shortest path and the fifth shortest path between the source node and any node.

[0093] It should be noted that the detailed steps for the electronic device to obtain N+1 alternative paths based on the source node and the N intermediate nodes of the second alternative path can be referred to the description of the electronic device calculating M+1 alternative paths based on the source node and M intermediate nodes in the above embodiment, which will not be repeated here.

[0094] S104b: The electronic device determines the first sub-path and the second sub-path in the first path set as two mutually exclusive paths.

[0095] The first path set includes: N+1 candidate paths, a second candidate path and a first shortest path; and the first sub-path and the second sub-path do not contain the same intermediate nodes.

[0096] It can be understood that after obtaining N+1 candidate paths, the electronic device can determine two mutually exclusive paths that do not contain the same intermediate nodes from the N+1 candidate paths, the second candidate path and the first shortest path.

[0097] In a possible implementation, the electronic device may perform pairwise matching on all subpaths in the first path set, and determine the first subpath and the second subpath as two mutually exclusive paths when the first subpath and the second subpath do not include the same intermediate node.

[0098] Based on the above technical solution, after the electronic device obtains M+1 candidate paths based on the source node and the M intermediate nodes of the first shortest path, when there is no mutually exclusive path corresponding to the first shortest path in the M+1 candidate paths, the electronic device can continue to match two mutually exclusive paths based on the shortest path in the M+1 candidate paths, thereby avoiding the problem of not being able to find two mutually exclusive paths. Therefore, the present application improves the reliability of calculating mutually exclusive paths.

[0099] The embodiment of the present application provides a mutually exclusive path calculation method. After the electronic device obtains M+1 candidate paths based on the source node and the M intermediate nodes of the first shortest path, the electronic device can determine the mutually exclusive path corresponding to the first shortest path from the M+1 candidate paths; and when there is no mutually exclusive path corresponding to the first shortest path in the M+1 candidate paths, the electronic device can continue to match two mutually exclusive paths based on the shortest path in the M+1 candidate paths, without traversing all paths from each node to the destination node, and avoiding the problem of not being able to find two mutually exclusive paths. Therefore, the present application improves the efficiency of calculating mutually exclusive paths while also improving the reliability of calculating mutually exclusive paths.

[0100] In some embodiments, such as Figure 2 As shown, the mutually exclusive path calculation method provided in the embodiment of the present application may include the following steps S1 to S10.

[0101] S1. Input a source node src, a destination node dst, a topology graph and a preset threshold disparity into an electronic device.

[0102] In a possible implementation, a topological graph is composed of a number of nodes and lines connecting the nodes, wherein the lines connecting the nodes have directions, and the weight cost of the lines is used to represent the distance between the two nodes.

[0103] S2. The electronic device calculates the shortest path from src to dst in the topological graph through the Dijkstra algorithm, records it as Pk, and then puts Pk into the set A.

[0104] S3. The electronic device regards each node except the node dst in the shortest path Pk as a deviation point, and records the deviation point as Vi, then traverses each deviation point, and for each deviation point, calculates the shortest path from the deviation point Vi to dst through Dijkstra.

[0105] In one possible implementation, i∈[1,x], where x is the number of deviation points.

[0106] S4. For each deviation point, the electronic device combines the shortest path from src to the deviation point Vi and the shortest path from the deviation point Vi to dst to obtain an alternative path corresponding to each deviation point, and puts the alternative path corresponding to each deviation point into set B.

[0107] In a possible implementation manner, the alternative path corresponding to each deviation point may also be understood as: the candidate path corresponding to each deviation point.

[0108] In some examples, assuming that the shortest path from src to dst is calculated to be P1, and there is a shortest or second shortest path P2 from src to dst, P2 is called a candidate path of P1.

[0109] S5. The electronic device determines whether the set B is empty.

[0110] When the set B is empty, the process ends; when the set B is not empty, the electronic device executes S6;

[0111] It can be understood that when the set B is empty, the electronic device can determine that there is no mutually exclusive path that meets the conditions, and the process ends.

[0112] S6. The electronic device determines whether there is a mutually exclusive path in the union of set A and set B.

[0113] In the case where there is a mutually exclusive path, the electronic device executes S7 and S9; in the case where there is no mutually exclusive path, the electronic device executes S8;

[0114] S7. The electronic device calculates a difference d between the weights of the two mutually exclusive paths.

[0115] S8. The electronic device determines the shortest path from set B and records it as Pk, then puts Pk into set A and deletes it from set B.

[0116] After executing S8, the electronic device continues to execute S3 in a loop.

[0117] S9. The electronic device determines whether the difference d ≤ disparity.

[0118] When the difference d≤disparity, the electronic device executes S10; when the difference d>disparity, the electronic device executes S8;

[0119] S10. The electronic device uses mutually exclusive paths in the union of set A and set B as separated dual paths.

[0120] It should be noted that for the relevant description of step S1 to step S10, reference can be made to the contents of the above embodiment, which will not be repeated here.

[0121] Example 1: Figure 3 Taking the topology graph shown in the figure as an example, the electronic device can use src=0, dst=5, disparity=3 as input:

[0122] 1. The electronic device calculates the shortest path A[1]: "0-1-3-5" using the Dijkstra algorithm, and adds A[1] to set A;

[0123] 2. The electronic device uses A[1] as the iteration path and starts traversing the offset points:

[0124] (1) Take node "0" (the source node mentioned above) as the offset point, set the weight between the path "0-1" to infinity, and perform a Dijkstra operation to obtain the path A^2-1: "0-2-4-5"

[0125] (i.e. the first shortest path mentioned above), the cost is 3, and the path A^2-1 is added to the set B;

[0126] (2) Take node "1" as the offset point, set the weight of the path "1-3" to infinity, perform a Dijkstra operation, and obtain the path A^2-2: "0-1-4-5" with a cost of 3. Then add the path A^2-2 to set B.

[0127] (3) Take node "3" as the offset point, set the weight of path "3-5" to infinity, perform a Dijkstra operation, and obtain path A^2-3: "0-1-3-4-5" with a cost of 4. Add path A^2-3 to set B.

[0128] 3. The offset point traversal is completed. There are four paths in set A and set B: "0-1-3-5", "0-2-4-5", "0-1-4-5", and "0-1-3-4-5". The electronic device matches the four paths in pairs and determines that path "0-1-3-5" and path "0-2-4-5" are mutually exclusive paths, and the difference in the cost of the two paths is 0, 0 < 3 (that is, the input disparity), so the electronic device can return to separate dual routes "0-1-3-5" and "0-2-4-5", and the program ends.

[0129] Example 2: Figure 3 Taking the topology graph shown in the figure as an example, the electronic device can use src=0, dst=6, disparity=3 as input:

[0130] 1. The electronic device calculates the shortest path A[1]: "0-1-6" using the Dijkstra algorithm, and adds A[1] to set A;

[0131] 2. The electronic device uses A[1] as the iteration path and starts traversing the offset points:

[0132] (1) Take node "0" as the offset point, set the weight between path "0-1" to infinity, perform a Dijkstra operation, and obtain path A^2-1: "0-2-1-6" with a cost of 3. Then add path A^2-1 to set B.

[0133] (2) Take node "1" as the offset point, set the weight between paths "1-6" to infinity, perform a Dijkstra operation, and obtain path A^2-2: "0-1-3-6" with a cost of 3. Add path "A^2-2" to set B.

[0134] 3. The offset point traversal is completed. There are three paths in set A and set B: "0-1-6", "0-2-1-6" and "0-1-3-6". The electronic device matches the three paths in pairs and determines that there are no mutually exclusive paths, and the process continues.

[0135] 4. The electronic device puts the path with the least cost in set B, "0-2-1-6" (i.e., the second alternative path mentioned above), into set A as A[2], and removes it from set B.

[0136] 5. The electronic device uses A[2] “0-2-1-6” as the iteration path and starts traversing the offset points:

[0137] (1) Taking node "0" as the offset point, setting the weight between the path "0-2" to infinity, and performing a Dijkstra operation, we get the path A^3-1: "0-1-6", but this path already exists in set B, so there is no offset path;

[0138] (2) Take node "2" as the offset point, set the weight of path "2-1" to infinity, perform a Dijkstra operation, and obtain path A^3-2: "0-2-4-3-6" with a cost of 4. Add path A^3-2 to set B.

[0139] (3) Take node "1" as the offset point, set the weight between paths "1-6" to infinity, perform a Dijkstra operation, and obtain path A^2-3: "0-1-4-3-6" with a cost of 4. Add path A^3-3 to set B.

[0140] 6. The offset point traversal is completed. There are 5 paths in set A and set B: "0-1-6", "0-2-1-6", "0-1-3-6", "0-2-4-3-6", and "0-1-4-3-6". The electronic device matches the five paths in pairs and determines that path "0-1-6" and path "0-2-4-3-6" are mutually exclusive paths, and the difference in the cost of the two paths is 2, 2 < 3 (that is, the input disparity), so the electronic device can return to separate dual routes "0-1-6" and "0-2-4-3-6", and the program ends.

[0141] In the embodiment of the present application, the time complexity of the mutually exclusive path calculation method provided by the present application depends on the number of nodes traversed and the time required for each Dijkstra calculation of the shortest path. Assuming the number of nodes is n and the number of variables is m, the time complexity of the heap-optimized Dijkstra algorithm is O((V+E)logV). In the best case, the method calculates two shortest paths, that is, it satisfies the separation dual path, so the time complexity is 2*O((V+E)logV). In the worst case, the method traverses all nodes and edges before finally finding the separation dual path, so the time complexity is O(V+E)*O((V+E)logV).

[0142] The various solutions in the above embodiments of the present application can be combined without contradiction.

[0143] The embodiment of the present application can divide the mutually exclusive path calculation device into functional modules or functional units according to the above method example. For example, each functional module or functional unit can be divided corresponding to each function, or two or more functions can be integrated into one processing module. The above integrated module can be implemented in the form of hardware or in the form of software functional modules or functional units. Among them, the division of modules or units in the embodiment of the present application is schematic, which is only a logical function division. There may be other division methods in actual implementation.

[0144] In the case of dividing each functional module into corresponding functional modules, Figure 4 A schematic structural diagram of a mutually exclusive path calculation device 70 is shown. The mutually exclusive path calculation device 70 may be an electronic device or a chip applied to an electronic device. The mutually exclusive path calculation device 70 may be used to execute the functions of the electronic device involved in the above embodiments. Figure 4 The illustrated mutually exclusive path calculation device 70 may include: an acquisition unit 701 , a calculation unit 702 , and a determination unit 703 .

[0145] An acquisition unit 701 is used to acquire a first shortest path from a source node to a destination node, where the first shortest path includes M intermediate nodes, where M≥0;

[0146] A calculating unit 702 is used to calculate M+1 candidate paths based on the source node and the M intermediate nodes included in the first shortest path obtained by the obtaining unit 701, where the source node and each of the M intermediate nodes correspond to one candidate path respectively;

[0147] The determining unit 703 is used to:

[0148] In the case that there is a path mutually exclusive with the first shortest path among the M+1 candidate paths, the first shortest path and the first candidate path mutually exclusive with the first shortest path are determined as two mutually exclusive paths; or,

[0149] When there is no mutually exclusive path with the first shortest path among the M+1 candidate paths, two mutually exclusive paths are determined based on the second candidate path, and the second candidate path is the shortest path among the M+1 candidate paths.

[0150] In one possible implementation, the above-mentioned calculation unit 702 is specifically used to calculate the second shortest path between any node and the destination node for the source node and any node among the M intermediate nodes, taking any node as a deviation point; and based on the second shortest path and the third shortest path from the source node to any node, calculate the alternative path corresponding to any node.

[0151] In a possible implementation, the determination unit 703 is further used to, when there is a path mutually exclusive with the first shortest path among the M+1 alternative paths, match the first shortest path with the M+1 alternative paths in pairs before determining the first shortest path and the first alternative path mutually exclusive with the first shortest path as two mutually exclusive paths, and, when the first alternative path among the M+1 alternative paths does not contain the same intermediate nodes as the first shortest path, determine that there is a path mutually exclusive with the first shortest path among the M+1 alternative paths.

[0152] In a possible implementation, the acquisition unit 701 is further used to acquire the cost of the first shortest path and the cost of the first alternative path when there is a path mutually exclusive with the first shortest path among the M+1 alternative paths. The determination unit 703 is specifically used to determine the first shortest path and the first alternative path as two mutually exclusive paths when the difference between the cost of the first shortest path acquired by the acquisition unit and the cost of the first alternative path is less than a preset threshold.

[0153] In a possible implementation, the acquisition unit 701 is further used to acquire N+1 candidate paths based on the source node and the N intermediate nodes of the second candidate path, where the source node and each of the N intermediate nodes correspond to an alternative path; N is a positive integer. The determination unit 703 is specifically used to determine the first subpath and the second subpath in the first path set as two mutually exclusive paths; wherein the first path set includes: N+1 candidate paths, the second candidate path and the first shortest path; the first subpath and the second subpath do not contain the same intermediate nodes.

[0154] As another possible way to achieve this, Figure 4The acquisition unit 701, the calculation unit 702 and the determination unit 703 in the embodiment can be replaced by a processor, which can integrate the functions of the acquisition unit 701, the calculation unit 702 and the determination unit 703.

[0155] The embodiment of the present application also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be completed by a computer program to instruct the relevant hardware, and the program can be stored in the above computer-readable storage medium. When the program is executed, it may include the processes of the above method embodiments. The computer-readable storage medium may be an internal storage unit of the mutually exclusive path calculation device of any of the above embodiments, such as a hard disk or memory of the mutually exclusive path calculation device. The above computer-readable storage medium may also be an external storage device of the above terminal device, such as a plug-in hard disk, a smart memory card (smart media card, SMC), a secure digital (secure digital, SD) card, a flash card (flash card), etc. equipped on the above terminal device. Further, the above computer-readable storage medium may also include both the internal storage unit of the above mutually exclusive path calculation device and an external storage device. The above computer-readable storage medium is used to store the above computer program and other programs and data required by the above mutually exclusive path calculation device. The above computer-readable storage medium can also be used to temporarily store data that has been output or is to be output.

[0156] It should be noted that the terms "first" and "second" in the specification, claims and drawings of the present application are used to distinguish different objects rather than to describe a specific order. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units that are not listed, or may optionally include other steps or units that are inherent to these processes, methods, products or devices.

[0157] It should be understood that in the present application, "at least one (item)" means one or more, "more than one" means two or more, "at least two (items)" means two or three and more than three, and "and / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the previous and next associated objects are in an "or" relationship. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.

[0158] Through the description of the above implementation methods, technical personnel in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional modules is used as an example. In actual applications, the above-mentioned functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0159] In the several embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the modules or units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another device, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0160] The units described as separate components may or may not be physically separated, and the components shown as units may be one physical unit or multiple physical units, that is, they may be located in one place or distributed in multiple different places. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0161] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0162] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, which is stored in a storage medium, including several instructions to enable a device (which can be a single-chip microcomputer, chip, etc.) or a processor (processor) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as USB flash drives, mobile hard drives, ROM, RAM, magnetic disks or optical disks.

[0163] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions within the technical scope disclosed in the present application shall be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A mutually exclusive path calculation method, characterized in that: Applied to electronic equipment, the method comprises: Obtain a first shortest path from a source node to a destination node, where the first shortest path includes M intermediate nodes, where M≥0; Based on the source node and the M intermediate nodes, M+1 candidate paths are calculated, and the source node and each of the M intermediate nodes correspond to one candidate path respectively; In the case that there is a path mutually exclusive with the first shortest path among the M+1 candidate paths, the first shortest path and the first candidate path mutually exclusive with the first shortest path are determined as two mutually exclusive paths; or, In the case that there is no mutually exclusive path with the first shortest path among the M+1 candidate paths, two mutually exclusive paths are determined based on a second candidate path, and the second candidate path is the shortest path among the M+1 candidate paths.

2. The method according to claim 1, characterized in that The calculating and obtaining M+1 candidate paths based on the source node and the M intermediate nodes includes: For the source node and any node among the M intermediate nodes, take the any node as a deviation point and calculate the second shortest path from the any node to the destination node; Based on the second shortest path and the third shortest path from the source node to the any node, an alternative path corresponding to the any node is calculated.

3. The method according to claim 1, characterized in that In the case that there is a path mutually exclusive with the first shortest path among the M+1 candidate paths, before determining the first shortest path and the first candidate path mutually exclusive with the first shortest path as two mutually exclusive paths, the method further includes: The first shortest path is matched with the M+1 alternative paths in pairs respectively. When the first alternative path in the M+1 alternative paths and the first shortest path do not contain the same intermediate nodes, it is determined that there is a path in the M+1 alternative paths that is mutually exclusive with the first shortest path.

4. The method according to any one of claims 1 to 3, characterized in that: In the case that there is a path mutually exclusive with the first shortest path among the M+1 candidate paths, determining the first shortest path and a first candidate path mutually exclusive with the first shortest path as two mutually exclusive paths includes: When there is a path mutually exclusive with the first shortest path among the M+1 candidate paths, acquiring a cost of the first shortest path and a cost of the first candidate path; When the difference between the cost of the first shortest path and the cost of the first candidate path is smaller than a preset threshold, the first shortest path and the first candidate path are determined as two mutually exclusive paths.

5. The method according to claim 1, characterized in that The determining of two mutually exclusive paths based on the second candidate path includes: Based on the source node and the N intermediate nodes of the second candidate path, N+1 candidate paths are obtained, wherein the source node and each of the N intermediate nodes correspond to one candidate path respectively; N is a positive integer; Determine the first subpath and the second subpath in the first path set as two mutually exclusive paths; The first path set includes: the N+1 candidate paths, the second candidate path and the first shortest path; the first sub-path and the second sub-path do not contain the same intermediate nodes.

6. A mutually exclusive path calculation device, characterized in that: Applied to electronic equipment, the device comprises: An acquisition unit, configured to acquire a first shortest path from a source node to a destination node, wherein the first shortest path includes M intermediate nodes, where M≥0; a calculating unit, configured to calculate M+1 candidate paths based on the source node and the M intermediate nodes included in the first shortest path acquired by the acquiring unit, wherein the source node and each of the M intermediate nodes correspond to one candidate path respectively; Identify units for: In the case that there is a path mutually exclusive with the first shortest path among the M+1 candidate paths, the first shortest path and the first candidate path mutually exclusive with the first shortest path are determined as two mutually exclusive paths; or, In the case that there is no mutually exclusive path with the first shortest path among the M+1 candidate paths, two mutually exclusive paths are determined based on a second candidate path, and the second candidate path is the shortest path among the M+1 candidate paths.

7. The device according to claim 6, characterized in that The calculation unit is specifically configured to calculate, for the source node and any one of the M intermediate nodes, the second shortest path between the any one of the nodes and the destination node by taking the any one of the nodes as a deviation point; And based on the second shortest path and the third shortest path from the source node to the any node, an alternative path corresponding to the any node is calculated.

8. The device according to claim 6, characterized in that The acquisition unit is further configured to acquire N+1 candidate paths based on the source node and the N intermediate nodes of the second candidate path, wherein the source node and each of the N intermediate nodes correspond to one candidate path respectively; N is a positive integer; The determining unit is specifically configured to determine the first sub-path and the second sub-path in the first path set as two mutually exclusive paths; The first path set includes: the N+1 candidate paths, the second candidate path and the first shortest path; the first sub-path and the second sub-path do not contain the same intermediate nodes.

9. A computer-readable storage medium, characterized in that: The readable storage medium stores instructions, and when the instructions are executed, the method according to any one of claims 1 to 5 is implemented.

10. A mutually exclusive path calculation device, characterized in that: include: A processor, a memory and a communication interface; wherein the communication interface is used for communication with the mutually exclusive path calculation device; The memory is used to store one or more programs, and the one or more programs include computer-executable instructions. When the mutually exclusive path calculation device is running, the processor executes the computer-executable instructions stored in the memory to enable the mutually exclusive path calculation device to perform the method described in any one of claims 1 to 5.

Images