Method for generating nested container with no intersection and full coverage in the same layer and readable storage medium

A method for generating nested container with no intersection and full coverage in the same layer, specifically comprising:

• step 1) giving a right undirected graph G (V, E, W) and a network measurement index set {Ti} to divide nodes in the right undirected graph G, such that each network measurement index Ti corresponds to a Ci layer container set {Ci k};
• thereof, the network measurement index Ti is specifically time delay or hop or bandwidth, Ti<Ti+1, 1≤i≤I−1, I is a constant, 0≤k≤K−1, and K is the number of Ci layer containers, and the number of layers i is initialized to I−1;
• step 2) deleting an edge with the weight being greater than Ti, segmenting the right undirected graph G in step 1) into several sub-graphs, thereof each sub-graph is a connected component;
• and sorting the several sub-graphs in an order of number of nodes from smallest to largest, thereof each sub-graph is donated as Gcm=(Vcm, Ecm, Wcm);
• thereof 1≤m≤M, M is the number of sub-graphs, m is a serial number of a sub-graph, and m, that is, the number of sub-graphs, is initialized to 1;
• if p isolated nodes exist in the several sub-graphs, then each isolated node is directly set as an anchor, and becomes an independent Ci layer container, and it is assumed that j′=j+p, and m=m+p;
• and the number of anchors j is initialized to 1;
• step 3) setting all the nodes in the sub-graph Gcm in step 2) which are not added in the Ci layer container as a set L;
• step 4) selecting one node from the set L in step 3) as a current anchor aj;
• step 5) taking the current anchor aj as a starting point, and performing breadth-first search on all the nodes in the set L and in the Ci+1 layer container containing aj with a path communicated therewith being less than Ti, to form a Ci layer container with aj as an anchor;
• step 6) setting j′=j+1, judging whether the set L is a null set;
• if the set L is a null set, then going to the next step, and if the set L is not a null set, then returning to step 3), until the set L is a null set;
• step 7) setting m=m+1, judging whether all the sub-graphs are processed, if all the sub-graphs are processed, then going to the next step, if all the sub-graphs are not processed, then returning to step 3), until all the sub-graphs are processed;
• and
• step 8) setting i=i−1, judging whether i=1 is satisfied;
• if i=1 is satisfied, then the process is finished and all the Ci containers are constructed;
• if i=1 is not satisfied, then returning to step 2), until all the Ci containers are constructed.