Nonderogatory Directed Webgraph

Algorithm 2

Input: 𝑚, 𝑛 and 𝑀 (output of the Algorithm 1)

(1) 𝑠←0

(2) for  𝑘=𝑚→𝑚𝑛  by  𝑚  do

(3)  for  𝑖=𝑘−𝑠→𝑚𝑛−1  do

(4)   𝑟_𝑖↔𝑟_𝑖+1

(5)   𝑐_𝑖↔𝑐_𝑖+1

(6)  end for

(7)  𝑠←𝑠+1

(8) end for

(9) for 𝑖=1→𝑚𝑛−𝑛  do

(10)  𝑟_𝑖←(−1)×𝑟_𝑖

(11) end for

Output: 𝑀