Analysis on Influential Functions in the Weighted Software Network

Algorithm 3

Top- nodes ().

Input: node set , NI of each node

Output: the top - influential nodes

Process:

(01) Initialize list //store the importance of nodes

(02) for (each node )

(03)list.add (NI());

(04) end for

(05) Collections.sort (list);

(06) Collections.reverse (list);

(07) print list.get ()