Algorithm 3: Edge switching adjustment

1: if(U(0,1) < β×d i/∑i d i) then

2:   [Is_Nodes_Found, v i, v a, v b, v c, v d ]←node_select(v i, v a);

3:   if(Is_Nodes_Found = false) then

4:     continue;

5:    else

6: G k‘ ← edge_switch(G k, v i, v a, v b, v c, v d);

7: else

8:   continue;

9: end if ;

10: avgGk‘ ← C(G k‘);//C(G k‘) evaluate cooperation level of G k‘ once;