(3a) shows this procedure using a network composed of 8 nodes.For each size "l""B", boxes are chosen randomly (as in the cluster growing method) until the network is covered, A box consists of nodes all separated by a distance of "l" "B", that is every pair of nodes in the box must be separated by a minimal paths of at most "l""B" links.