Method, device and equipment for constructing one-to-many disjoint paths of partition exchange graph

Abstract

The present application discloses a method, device and equipment for constructing one-to-many non-intersecting paths of a partition exchange graph, and relates to the field of computer technology. The construction method includes: obtaining neighboring points and target points of a source point to obtain a neighboring point set and a target point set; screening out target points directly connected to the source point, recording them as internal target points, and constructing internal non-intersecting paths between the source point and the internal target point; recording the external subgraph connected to the neighboring points in the neighboring point set excluding the internal target point into a first set, and recording the external subgraph connected to the target points in the target point set excluding the internal target point into a second set; constructing external non-intersecting paths based on the first set and the second set. This scheme realizes the construction of one-to-many non-intersecting paths on a partition exchange graph, and applies the non-intersecting paths to the Internet, thereby improving the fault tolerance of the Internet structure and the efficiency of parallel traffic transmission.

Description

Technical field

[0001] The present invention relates to the field of computer technology, and in particular to a division and exchange Picture 1 A construction method, device and device for a multi-disintersecting path. Background technology

[0002] A high-performance parallel computer is a computer system. As the performance of the computer system continues to improve, the number of processors it has also become more and more. The network obtained by connecting several processors in a specific way is called an interconnect network. An interconnect network may be represented by a simple graph G=(V,E), where V(G) represents the set of vertices of the graph and E(G) represents the set of edges. The vertices in Figure G represent processor nodes in the interconnection network, and the edges represent connection links between processor nodes.

[0003] A partition exchange graph is a typical interconnection network topology. An n-dimensional division exchange graph DSCn has 2 n (n=2 d ,d≥1) vertices, and their vertex connectivity is d+1. According to Mengel's theorem, there is d+1 disjoint path between any two disjoint vertices sets. Disintersecting paths have better fault tolerance than intersecting paths, because one path fails to affect other paths to continue working. Meanwhile, disintersection paths can provide more efficient parallel transmission of traffic because the total bandwidth is the sum of bandwidth for each path when traffic is transmitted along the disintersection path. At present, in the field of dividing the exchange graph DSCn, there is no one-to-many disintersection path construction method. Contents of invention

[0004] The object of the present invention is to provide a division exchange Picture 1 The construction method, device and equipment of a for-many disintersection path are used to improve the fault tolerance of the Internet network structure by constructing a one-to-many disintersection path in the divided exchange diagram.

[0005] To achieve the above objectives, the present invention discloses the following technical solutions:

[0006] The first aspect of the present invention provides a division exchange Picture 1 A method for constructing multiple disintersecting paths, the partition switching diagram is used to represent an interconnection network, the interconnection network is a network obtained by connecting several processors in a specific way, and the method includes:

[0007] Obtain the neighbors and target points of the source point, and obtain the neighbors and target points sets, and the source point and the target point are located in the same sub-graph;

[0008] The target point directly connected to the source point is selected in the target point, and it is denoted as an internal target point, and an internal disjoint path is constructed between the source point and the internal target point;

[0009] The external submap for removing the adjacent point connections from the internal target points in the adjacent point set is recorded in the first set, and the external submap for removing the target points connections from the internal target points in the target points set is recorded in the target points set is recorded in the external submap for removing the target points connections from the internal target points. Enter the second set;

[0010] An external disintersecting path is constructed based on the first set and the second set.

[0011] The above-mentioned construction method includes a source point s and d+1 target point, and the adjacent point set is N={s 1 ,s 2 ,…,s d ,s d+1}, the target point set is T={t 1 ,t 2 ,…,t d ,t d+1}.

[0012] The above-mentioned construction method, in the target point, the target point directly connected to the source point is selected, and the internal disjoint is constructed between the source point and the internal target point. Paths, including:

[0013] The target point directly connected to the source point is selected from the target point, and it is recorded as an internal target point, and the internal target point is recorded into the internal target point set T k ={t 1 ,t 2 ,…,t k}(1≤k≤d);

[0014] At the source point s and the internal target point t k Internal disjoint paths are constructed between them.

[0015] In the above-mentioned construction method, the external submap of the adjacent points grouping removed adjacent points from the internal target points is recorded in the first set, including:

[0016] The inner target point is removed from the adjacent point set N to obtain the outer adjacent point set N'=N-T k ;

[0017] Determine whether there are internal neighbor s in the external neighbor set N' α (1≤α≤d) is the same as the external sub-map connected to the source point s. If so, the internal neighbor point s is obtained α The inner neighbor s α,β (1≤β≤d), and the external neighbor point set N′=(N-T k )∪{s α,β}-{s α};

[0018] The external subgraphs of all neighboring points connections in the external neighbor set N' are recorded in the first set X.

[0019] The above-mentioned construction method, the external submap of the target point connections removed from the internal target point in the second set is recorded in the second set:

[0020] The internal target point is removed from the target point set T to obtain the external target point set T'=T-T k ;

[0021] The external submap of all target points connections in the external target point set T' is recorded in the second set Y.

[0022] The above-mentioned construction method, the external disjoint path is constructed based on the first set and the second set, and includes:

[0023] Based on the intersection Z of the first set X and the second set Y 0 =X∩Y, construct a path within the subgraph within each subgraph;

[0024] Based on the complement set Z of the first set X relative to the second set Y 1 =X-X∩Y, and the complement set Z of the second set Y relative to the first set X 2 =Y-X∩Y, add the supplement Z 1 With the supplementary Z 2 The child in the middle Picture 1 Once paired, a path between sub-graphs is constructed separately between two paired sub-graphs.

[0025] Another aspect of the invention provides a division exchange Picture 1 For a construction device of many disintersecting paths, the partition switching diagram is used to represent an interconnection network, the interconnection network is a network obtained by connecting several processors in a specific manner, and the device includes:

[0026] The point set acquisition module is used to obtain the neighbors and target points of the source point, and obtain the neighbors and target points sets, and the source point and the target point are located in the same sub-graph;

[0027] The internal path module is used to filter out the target point directly connected to the source point in the target point, denoted as an internal target point, and construct an internal disjoint path between the source point and the internal target point. ;

[0028] The external subgraph module records the external subgraph of the adjacent point centered to remove the external neighbor point connection from the internal target point into the first set, and removes the external target outside the internal target point in the first set. The external subgraph of the point connection is recorded in the second set;

[0029] An external path module is configured to construct an external disintersecting path based on the first set and the second set.

[0030] The above-mentioned structural device, the external path module includes:

[0031] The path unit in the sub-graph is used for intersection Z based on the first set X and the second set Y 0 , construct a path within the subgraph within each subgraph;

[0032] The inter-subgraph path unit is used for complementary set Z based on the first set X relative to the second set Y 1 , and the complement set Z of the second set Y relative to the first set X 2 , the supplementary Z is 1 With the supplementary Z 2 The child in the middle Picture 1 Once paired, a path between sub-graphs is constructed separately between two paired sub-graphs.

[0033] The present invention also provides an electronic device, including a memory, a processor, and a computer program stored on the memory and can be run on the processor, and the processor implements the first aspect when executing the computer program The division and exchange of Picture 1 A construction method for many disintersecting paths.

[0034] In addition, the present invention also provides a computer readable storage medium, wherein a computer program is stored on the computer readable storage medium, and the partitioning and exchange described in the first aspect is realized when the computer program is executed by a processor. Picture 1 A construction method for many disintersecting paths.

[0035] The effects provided in the summary are only the effects of the embodiments, not all the effects of the invention. One of the above technical solutions has the following advantages or beneficial effects:

[0036] Partition exchanges provided in this application Picture 1 For the construction method of many disintersection paths, first, filter out the internal target points directly connected to the source point within the sub-graph, and construct the internal disintersection path between the source point and the internal target point; then between the sub-graph, obtain The external subgraph of adjacent points connected outside the internal target point and the external subgraph of target point connection outside the internal target point are constructed between these external subgraphs to realize the division exchange map DSCn. When the source point and d+1 target vertices are located in the same subgraph, d+1 disintersection path is constructed, and the disintersection path is applied to the Internet network to improve the fault tolerance of the Internet network structure and the efficiency of parallel traffic transmission. Attached description of the drawings

[0037] The accompanying drawings here are incorporated into and form part of the specification, show embodiments that comply with the present application, and together with the description, serve to explain the principles of the present application.

[0038] Figure 1 Switch diagram for existing 2D division DSC 2 and 4-dimensional partition exchange graph DSC 4 schematic diagram;

[0039] Figure 2 From the source point s to the target vertex t i Schematic diagram of one-to-many disintersection path structure of (1≤i≤k);

[0040] Figure 3 The division exchange provided for an embodiment of this application Picture 1 Schematic diagram of the construction method of many disintersected paths;

[0041] Figure 4 Partition exchange provided for another embodiment of the present application Picture 1 Schematic diagram of the construction method of many disintersected paths;

[0042] Figure 5For this application, a division exchange Picture 1 Schematic diagram of the disintersection path for many;

[0043] Figure 6 The division exchange provided for an embodiment of this application Picture 1 Schematic diagram of structural device for many disintersecting paths;

[0044] Figure 7 A schematic diagram of the structure of the electronic device provided for an embodiment of the present application;

[0045] Reference numerals:

[0046] 600-Disintering path construction device, 610-Point set acquisition module, 620-Internal path module, 630-External subgraph module, 640-External path module, 641-Inner path unit, 642-Inter-Subgraph path unit;

[0047] 700-electronic device, 710-input unit, 720-memory, 730-processor, 740-output unit. Specific implementation methods

[0048] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for the purpose of explaining the invention only and are not intended to limit the invention.

[0049] It should be noted that references in this specification for "one embodiment", "embodiment", "example embodiment", etc., refer to the description of the embodiment may include specific features, structures or characteristics, but not every Each embodiment must include these specific features, structures, or characteristics. Furthermore, such a statement does not refer to the same embodiment. Further, when describing specific features, structures or characteristics in connection with embodiments, whether or not explicitly described, it has been shown that such features, structures or characteristics are within the knowledge of those skilled in the art. .

[0050] This application provides a division exchange Picture 1 The construction method, device and equipment for many disintersection paths are used to construct d+1 non-contact diagrams on the partition exchange diagram DSCn (representing the Internet network). When d+1 target vertex and source point s are located in the same sub-graph, d+1 non-construction Intersection paths, apply disintersection paths to the Internet network, improve the fault tolerance of the Internet network structure, and fill the technical gap in the current technology of dividing the exchange graph DSCn.

[0051] In order to better understand the technical solution of the present application, the relevant background knowledge of the partition exchange diagram DSCn is first described below.

[0052] In the prior art, an n-dimensional division exchange graph DSC n There are 2 n (n=2 d ,d≥1) vertices, each vertex can be represented as a binary string of n-bits, that is, u=s 1 s 2 …s n , where, s i =0,1(1≤i≤n). like Figure 1 Shown, Figure 1 Switch diagram for existing 2D division DSC 2 and 4-dimensional partition exchange graph DSC 4 Schematic diagram of , when n=2, 01 and 10 are the labels of two vertices, and when n=4, 0101 and 1001 are the labels of two vertices. Divide the representation of the vertex u into 3 parts, that is, u=s 1 s 2 …s n =t 1 t 2 t 3 , where, t 1 See the following formula (1), t 2 See the following formula (2), t 3 See the following formula (3):

[0053]

[0054]

[0055]

[0056] Note that if k=1, then t 3 It's an empty string. For DSC n Another vertex v of , v, is called u and v connected when v meets one of the following conditions.

[0057] (1) in, At this time, (u,v) is called the e(1) edge.

[0058] (2) If t 1 =t 2 ,but If t 1 ≠t 2 , then v=t 2 t 1 t 3 . At this time, (u,v) is called side.

[0059] refer to Figure 1 ,exist Figure 1 In (b), vertex 0000 is connected to vertex 1000, and vertex 1110 is connected to vertex 1011. For convenience of expression, vertices are directly used in the following text. For any vertex u, there are d+1 vertices connected to it.

[0060] In the partition exchange graph, if two vertices are connected, the two vertices are neighbors or neighbors. For any vertex u, if (u,v) is an e(1) edge, then v is called u's 1 neighbor, denoted as v=u 1 . If (u,v) is The edge, then v is called the d+2-k neighbor of u, and is denoted as v=u i (i=d+2-k). For example Figure 1 In (b), the 1 neighbor of the vertex 0000 is 1000 and the 2 neighbors are 1100, so 1000=0000 1 , 1100=0000 2 . In addition, u i,j Represents the j neighbor of the i neighbor of the vertex u, and so on. Specifically, the relationship between node neighbors and edges in the partition exchange graph is shown in Table 1:

[0061] Table 1: The relationship table between node neighbors and edges in the interchange graph

[0062]

[0063] The partition exchange graph has a distinct hierarchy, a DSC n Depend on indivual Constitute, each Called DSC n sub-graph or module, DSC n The son Picture 1 Generally expressed as For any vertex u, the d neighbors located in the same sub-graph are called internal neighbors and are denoted as u 1 ,u 2 ,…u d , At the same time, u has an adjacent point located in a different sub-graph, called an external adjacent point, and is called u d+1 .

[0064] In the partition exchange graph, a path is a sequence composed of several different vertices, expressed as P=<p 1 ,p 2 ,…,p t >. Among them, p i and p i+1 (1≤i≤t-1) is connected, that is, (p i ,p i+1 ) is an edge. p 1 and p t Two endpoints of the path are called, and the other vertices are called internal vertices. If the two paths have different internal vertices except the two endpoints are the same, then these two paths are called disjoint paths. For the source vertex set {s} and the target vertex set {t 1 ,t 2 ,…,t k}, a one-to-many disintersection path refers to constructing k bars from vertex s to target vertex t i (1≤i≤k), refer to Figure 2 , Figure 2 From the source point s to the target vertex t i Schematic diagram of the one-to-many disintersection path structure of (1≤i≤k).

[0065] Due to the existing division exchange graph DSC n All use the intersection path construction method. At present, there is no proposal for the disjoint path construction method. Based on this, this application proposes a division exchange Picture 1 For the construction method of a multi-disintersecting path, referring specifically to the description of the following embodiments.

[0066] refer to Figure 3 , Figure 3 The partition exchange provided by an embodiment of the present application is shown Picture 1 A schematic diagram of the construction method of many disjoint paths, including the following steps:

[0067] S310. Obtain the neighbors and target points of the source point, and obtain the neighbors and target points sets, where the source and target points are located in the same sub-graph;

[0068] S320. Filter out the target points directly connected to the source point in the target point, record it as an internal target point, and construct an internal disjoint path between the source point and the internal target point;

[0069] S330. The external submap of the adjacent point connections removed from the internal target points in the first set is recorded in the first set, and the external submap of the target points removed from the internal target points in the second set is recorded in the second set;

[0070] S340: Construct an external disintersection path based on the first set and the second set.

[0071] In this embodiment, first, an internal disjoint path is constructed between the source point inside the sub-graph and the internal target point, and then an external sub-graph of adjacent points connected outside the internal target point is removed outside the sub-graph and an external target point is removed from the external sub-graph. The external disintersection path is constructed between the external subgraphs of the target point connection, so as to realize the construction of the disintersection path between the source point and the target point.

[0072] Specific reference Figure 4 , Figure 4 The partition exchange provided by another embodiment of the present application is shown Picture 1 A flow diagram of the construction method of a multi-disintersecting path, which includes a source point s and d+1 target point, and the source point and target point are located in the same sub-graph, which specifically includes the following steps:

[0073] S410. Obtain the neighbor point and target point of the source point s, and obtain the neighbor point set N={s 1 ,s 2 ,…,s d ,s d+1} and target point set T={t 1 ,t 2 ,…,t d ,t d+1};

[0074] S420. The target point directly connected to the source point is selected from the target point and the internal target point is recorded as an internal target point, and an internal disjoint path is constructed between the source point and the internal target point;

[0075] In a specific implementation, step S420 may further include:

[0076] S421. The target point directly connected to the source point is selected from the target point and recorded as an internal target point and recorded in the internal target point set Tk ={t 1 ,t 2 ,…,t k}(1≤k≤d);

[0077] S422. Construct an internal disjoint path between the source point and the internal target point.

[0078] S430. The external submap of the adjacent point connections removed from the internal target points in the first set is recorded in the first set, and the external submap of the target points removed from the internal target points in the second set is recorded in the second set;

[0079] In a specific implementation, step S430 may further include:

[0080] S431. Remove the internal target point from the neighbor set N to obtain the external neighbor set N′=N-T k ;

[0081] S432. Determine whether there are internal neighbor s in the external neighbor set N′ α (1≤α≤d) is the same as the external sub-map connected to the source point s,

[0082] If so, then proceed to step S433;

[0083] If not, then proceed to step S434;

[0084] S433. Obtain the internal neighbor s α The inner neighbor s α,β (1≤β≤d), and the external neighbor point set N′=(N-T k )∪{s α,β}-{s α};

[0085] S434. The external subgraphs of all neighbor points connected in the external neighbor point set N' are recorded in the first set X;

[0086] S435. Remove the internal target points from the target point set T to obtain the external target point set T′=T-T k ;

[0087] S436. The external submap of all target points connected in the external target point set T' is recorded in the second set Y.

[0088] S440. Construct an external disintersection path based on the first set X and the second set Y;

[0089] In a specific implementation, step S440 may further include:

[0090] S441. Intersection Z based on the first set X and the second set Y 0 =X∩Y, construct a path within the subgraph within each subgraph;

[0091] S442. Complement Z based on the first set X relative to the second set Y 1 =X-X∩Y, and the complement Z of the second set Y relative to the first set X 2 =Y-X∩Y, Z 1 With Z 2 The child in the middle Picture 1 Once paired, a path between sub-graphs is constructed separately between two paired sub-graphs.

[0092] Through the method of this embodiment, it is possible to construct d+1 disintersection paths between the source point s and d+1 target points. Applying these disintersection paths to the Internet network can effectively improve the structure of the Internet network Fault tolerance and efficiency of parallel traffic transmission. refer to Figure 5 It is shown that it is a division exchange of the present application Picture 1 Schematic diagram of the disintersection path for many.

[0093] In a specific implementation, the program algorithms corresponding to some embodiments are as follows:

[0094]

[0095]

[0096]

[0097] Taking n=8 and d=3 as an example, in the partition exchange graph DSC 8 In, let the source point s = 00000000, and the target set T = {10000000,11100000,10110000,00010000}. According to the construction method of the above-mentioned embodiment, the following four non-intersecting paths can be constructed:

[0098] P 1 :<00000000,10000000>;

[0099] P 2 :<00000000,1100000,0001100,10001100,00101100,11101100,11001100,11001110,00001110,11100000>;

[0100] P 3 :<00000000,11111111,0111111,10111111,11111011,00111011,11001011,00001011,10110000>;

[0101] P 4 :<00000000,11110000,01110000,0000111,10000111,01000111,00010111,01110001,0110001,00110001,000001,00010000>.

[0102] It should be noted that for the method embodiments, for brief description, they are all expressed as a series of action combinations, but those skilled in the art should know that the embodiments of this application are not limited by the described action sequence because According to embodiments of the present application, certain steps may be performed in other sequences or simultaneously. Secondly, those skilled in the art should also understand that the embodiments described in the specification are preferred embodiments and the actions involved are not necessarily necessary for the embodiments of the present application.

[0103] refer to Figure 6 , Figure 6 The partition exchange provided by an embodiment of the present application is shown Picture 1 Schematic diagram of structural device for many non-intersecting paths, using this device to realize division and exchange Picture 1 For the configuration of a multi-disintersecting path, the device described below can be referenced in correspondence with the methods described above. The non-intersecting path construction device 600 includes:

[0104] The point set acquisition module 610 is used to obtain the neighbors and target points of the source point, and obtain the neighbors and target points sets, and the source points and target points are located in the same sub-graph;

[0105] The internal path module 620 is used to filter out the target points directly connected to the source point, denoted as internal target points, and construct an internal disjoint path between the source point and the internal target point;

[0106] The external subgraph module 630 is used to record the external subgraph of the adjacent point centered to remove the adjacent point connections from the internal target points into the first set, and record the external subgraph of the target point centered to remove the target point connections from the internal target points. Enter the second set;

[0107] The external path module 640 is configured to construct an external disintersecting path based on the first set and the second set.

[0108] In some embodiments, the external path module 640 may specifically include:

[0109] The path unit 641 in the sub-graph, for the intersection Z based on the first set X and the second set Y 0 =X∩Y, construct a path within the subgraph within each subgraph;

[0110] The inter-subgraph path unit 642 is used for complementary set Z based on the first set X relative to the second set Y 1 =X-X∩Y, and the complement Z of the second set Y relative to the first set X 2 =Y-X∩Y, Z 1 With Z 2 The child in the middle Picture 1 Once paired, a path between sub-graphs is constructed separately between two paired sub-graphs.

[0111] Embodiments of the present application also provide an electronic device, in some embodiments, reference Figure 7 As shown, the electronic device 700 includes an input unit 710 , a memory 720 , a processor 730 , and an output unit 740 . The memory 720 stores program instructions that can be run on the processor 730, which calls program instructions to be able to execute a one-to-many disintersecting path construction method and / or technical solution based on the aforementioned embodiments. The electronic device 700 may be a mobile terminal device such as a mobile phone, a computer, or the like.

[0112] In addition, the embodiment of the present application also provides a computer readable storage medium for storing execution such as Figure 3 or Figure 4 Any division exchange Picture 1 Computer program for constructing methods of many disjoint paths. For example, a computer program instruction, when executed by a computer, may invoke or provide a method and / or technical solution according to the present application, through the operation of the computer. Program instructions that call the methods of the present application may be stored in a fixed or removable storage medium and / or transmitted and / or stored in accordance with program instructions by broadcasting or other signals carrying data streams in the media Running in the storage medium.

[0113] Obviously, those skilled in the art will understand that the modules or steps of the present application described above can be implemented with a general computing device, which can be concentrated on a single computing device, or distributed in a network composed of multiple computing devices. On the above, optionally, they can be implemented with program code executable by the computing device, so that they can be stored in a storage device and executed by the computing device, or they can be made into individual integrated circuit modules, or they can be Multiple modules or steps of the process are made into a single integrated circuit module to implement. In this way, this application is not limited to any particular combination of hardware and software.

[0114] Although the present application has been described in detail above with general description and specific embodiments, some modifications or improvements may be made on the basis of this application, which will be apparent to those skilled in the art. Therefore, these modifications or improvements made without departing from the spirit of this application are within the scope of the claimed application.

Claims

1. A method for constructing one-to-many disjoint paths in a partitioned exchange graph, characterized in that: The partition exchange graph is used to represent an interconnection network, where the interconnection network is a network obtained by connecting a plurality of processors in a specific manner. The method comprises: Obtain the neighboring points and target points of the source point to obtain a neighboring point set and a target point set, wherein the source point and the target point are located in the same subgraph, and the method includes a source point s and d+1 target points, and the neighboring point set is N={s 1 ,s 2 ,…,s d ,s d+1 }, the target point set is T = {t1, t2, …, t d ,t d+1 }; Filtering out target points directly connected to the source point from the target points, recording them as internal target points, and constructing internal non-intersecting paths between the source point and the internal target points, including: Filter out the target points directly connected to the source points from the target points, record them as internal target points, and record the internal target points into the internal target point set T k ={t1,t2,…,t k }, where 1≤k≤d; Between the source point s and the internal target point t k Construct internal non-intersecting paths between them; Recording the external subgraph connected to the neighboring points in the neighboring point set excluding the internal target point into the first set includes: Remove the internal target point from the neighboring point set N to obtain an external neighboring point set N'=NT k ; Determine whether there is an internal neighbor point s in the external neighbor point set N' α The same as the external subgraph connected to the source point s, if so, get the internal neighboring point s α The internal neighbors of α,β , and regain the external neighbor point set N'=(NT k )∪{s α,β }-{s α }, where 1≤α≤d, 1≤β≤d; Record the external subgraphs connected by all neighboring points in the external neighboring point set N' into the first set X; Recording the external subgraph connected to the target points in the target point set excluding the internal target points into the second set includes: Remove the internal target points from the target point set T to obtain an external target point set T'=TT k ; Recording the external subgraphs connected to all target points in the external target point set T' into the second set Y; Constructing an external non-intersecting path based on the first set and the second set, comprising: Based on the intersection Z0=X∩Y of the first set X and the second set Y, construct an intra-subgraph path in each subgraph; Based on the complement Z1=XX∩Y of the first set X relative to the second set Y, and the complement Z2=YX∩Y of the second set Y relative to the first set X, the subgraphs in the complement Z1 and the complement Z2 are paired one by one, and an inter-subgraph path is constructed between every two paired subgraphs.

2. A device for constructing one-to-many disjoint paths in a partitioned exchange graph, characterized in that: The method for constructing one-to-many disjoint paths of a partitioned exchange graph according to claim 1 is adopted, and the device comprises: A point set acquisition module is used to acquire neighboring points and target points of a source point to obtain a neighboring point set and a target point set, wherein the source point and the target point are located in the same subgraph; An internal path module, used for selecting target points directly connected to the source point from the target points, recording them as internal target points, and constructing internal non-intersecting paths between the source point and the internal target points; An external subgraph module, used for recording an external subgraph connected to neighboring points in the neighboring point set excluding the internal target point into a first set, and recording an external subgraph connected to target points in the target point set excluding the internal target point into a second set; An external path module is used to construct an external non-intersecting path based on the first set and the second set.

3. The construction device according to claim 2, characterized in that The external path module includes: An intra-subgraph path unit, configured to construct an intra-subgraph path in each subgraph based on an intersection Z0 of the first set X and the second set Y; An inter-subgraph path unit is used to pair the subgraphs in the complement Z1 with those in the complement Z2 based on the complement Z1 of the first set X relative to the second set Y and the complement Z2 of the second set Y relative to the first set X, and to construct an inter-subgraph path between every two paired subgraphs.

4. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the method for constructing one-to-many disjoint paths of a partitioned exchange graph as described in claim 1 is implemented.

5. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method for constructing a one-to-many disjoint path of a partitioned exchange graph as described in claim 1 is implemented.

Images