Research Article
A Multilevel Simplification Algorithm for Computing the Average Shortest-Path Length of Scale-Free Complex Network
Table 1
The SSSPL of each node and the ASPL of the original and simplified networks.
| | Node | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | SSSPL of node in | Number of shortest paths in | SSSPL of node in | Number of shortest paths in |
| | 1 | — | 1 | 1 | 2 | 2 | 2 | 2 | 3 | 13 | 7 | 6 | 4 | | 2 | 3 | — | 2 | 1 | 1 | 1 | 3 | 4 | 15 | 7 | 9 | 4 | | 3 | 1 | 2 | — | 3 | 3 | 3 | 1 | 2 | 15 | 7 | 7 | 4 | | 4 | 2 | 3 | 1 | — | 4 | 4 | 2 | 3 | 19 | 7 | 8 | 4 | | 5 | 0 | 0 | 0 | 0 | — | 0 | 0 | 0 | 0 | 0 | — | | | 6 | 0 | 0 | 0 | 0 | 0 | — | 0 | 0 | 0 | 0 | — | | | 7 | 0 | 0 | 0 | 0 | 0 | 0 | — | 1 | 1 | 1 | 0 | | | 8 | 0 | 0 | 0 | 0 | 0 | 0 | | — | 0 | 0 | — | |
| | Sum | Shortest path between nodes | 63 | 29 | 30 | 16 |
|
|
