Patent ID: 11231954

Abstract:
A method for generating a nested container with no intersection and same layer full coverage, including: 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}; deleting an edge weighing greater than Ti, and segmenting G into subgraphs, each a connected component; setting all nodes in the subgraph Gcm not in the Ci layer container as set L; selecting one node from set L as current anchor aj; starting with anchor aj, performing breadth-first search on all nodes in L and Ci+1 layer container containing aj with the path communicated therewith less than Ti forming a Ci layer container with anchor aj; setting j′=j+1, determining whether L is a null set; setting m=m+1, determining whether all subgraphs are processed; setting i=i−1, and determining whether i=1 is satisfied.