Research Article

Identifying Key Classes Algorithm in Directed Weighted Class Interaction Network Based on the Structure Entropy Weighted LeaderRank

Algorithm 1

IKC-SEWL.
Input: software source code.
Output: key classes in DWCIS-Network.
(1)for each class interaction from class to class do 2–5 / DWCIS-Network construction /
(2) Extract class , class as , and put them into set ;
(3) Extract the class interaction from class to class as and put it set ;
(4) is calculated for by formula (1), put it into set ;
(5) and are calculated by formulas (3) and (4) and put them into set ;
(6)With 1–5, DWCIS-Network is obtained;
(7)for each in do 8/ Initialization stage /
(8) is initialized with by formula (6);
(9) is initialized with 0 by formula (7);
(10)for each in dimensional do 11
(11) is initialized by formulas (8) and (9);
(12)while the constraint condition of formula (12) is not true do 13–15 / Iteration stage/
(13)for each in of dimensional do 14, 15
(14)   is calculated by formula (11);
(15)   is updated by formula (10);
(16)for each in do 17 / Iteration completed/
(17) is calculated by formula (13);
(18)All classes are ranked in descending order by using corresponding scores in the set of , top- classes are obtained and key classes are identified;