Algorithm A2 Sorting links

Require:$C_{ij}$ correlation matrix Ensure: a correlation matrix $C_{ij}$ that contains in the secondary diagonal the pairs of nodes that always share the same opinion in the steady state, regardless of the initial set of opinions. Rows and columns are sorted in such way that the structure of the network can be inferred from its visual representation

set $pivot=C_{ij}$ dimension  sort from lowest to highest correlation value $C_{pivot,node}$ all nodes from 1 to pivot  repeat   set the new pivot   for all $i\in C_{pivot,i}$ do     if $C_{pivot,i}=1$ then      $pivot\leftarrow i-1$     end if   end for until$pivot=1$ return$C_{ij}$ sorted correlation matrix