METHOD FOR GENERATING NESTED CONTAINER WITH NO INTERSECTION AND FULL COVERAGE IN THE SAME LAYER AND READABLE STORAGE MEDIUM

摘要

A method for generating a nested container with no intersection and full coverage in the same layer, comprising: step 1) giving a right undirected graph G(V, E, W) and network measurement index set {Ti} for dividing nodes in G, each network measurement index Ti corresponding to a Ci layer container set {Ci k}; step 2) deleting an edge with the weight greater than Ti, and segmenting G into a plurality of subgraphs, each subgraph being a connected component; step 3) setting all nodes in the subgraph Gcm that are not added in the Ci layer container as a set L; step 4) selecting one node from the set L as a current anchor aj; step 5) using the current anchor aj as a starting point, performing breadth-first search on all nodes in the L and in the Ci+1 layer container containing aj with the path communicated therewith less than Ti to form a Ci layer container with aj as an anchor; step 6) setting j'=j+1, and determining whether the L is a null set; step 7) setting m=m+1, and determining whether all the subgraphs are processed; and step 8) setting i=i-1, and determining whether i=1 is satisfied.