A Multilevel Simplification Algorithm for Computing the Average Shortest-Path Length of Scale-Free Complex Network

Table 2

Length and number of shortest path reduced in simplification.

Node	2	2	7
1	1	1	2
2	—	—	3
3	2	2	1
4	3	3	2
7	0	0	—
(𝑘∈𝐺∑′,𝑘<>𝑐)length(𝑘,𝑐)	6	6	8
(𝑘∈𝐺∑′,𝑘<>𝑐)𝑖	3	3	4
(𝑘∈𝐺∑′,𝑘<>𝑐)(length(𝑘,𝑐)+𝑖)+1	10	10	13
(𝑘∈𝐺∑′,𝑘<>𝑐)(𝑖)+1	4	4	5