Write a computer program to add three new links greedily in an N-node string topology network (see Figure 5.17(a) for a reference). Note that the greedy global decision–based link addition should optimize the average path length of the network after addition of each link. Also, there are no self-loops or parallel edges in the network (before or after new link addition).

What will be an ideal response?

This problem is a computer-based exercise. Some Matlab code fractions available for simula-
tions can be found at https://complexnetworksbook.github.io.