A New Metaheuristic-Based Hierarchical Clustering Algorithm for Software Modularization

<table class="algorithm-group"><tr><td><table class="algorithm" id="alg3"><tr><td> </td><td>Input: a chromosome as ch</td></tr><tr><td> </td><td>Output: update ch.fitness</td></tr><tr><td> </td><td>ch.fitness = 0</td></tr><tr><td> </td><td>tree ← decode the chromosome ch to tree</td></tr><tr><td> </td><td>q ← Queue()</td></tr><tr><td> </td><td>tree.root.cf = 1</td></tr><tr><td> </td><td>q.push(tree.root)</td></tr><tr><td> </td><td>while q is not empty do</td></tr><tr><td> </td><td> parent ← q.pop()</td></tr><tr><td> </td><td> child1, child2 ← t.children()</td></tr><tr><td> </td><td> child1.cf ← exCF(child1, parent)</td></tr><tr><td> </td><td> child2.cf ← exCF(child2, parent)</td></tr><tr><td> </td><td> if child1.cf + child2.cf ≥ parent.cf then</td></tr><tr><td> </td><td>  q.push(child1)</td></tr><tr><td> </td><td>  q.push(child2)</td></tr><tr><td> </td><td> else</td></tr><tr><td> </td><td>  ch.fitness ← ch.fitness + parent.cf</td></tr><tr><td> </td><td> end if</td></tr><tr><td> </td><td>end while</td></tr></table></td></tr></table>

<div> Pseudocode of chromosome evaluation.</div>

Complexity

alg3

Algorithm 3

Algorithm 3: A New Metaheuristic-Based Hierarchical Clustering Algorithm for Software Modularization 