Table 2

Input: a graph G = (V , E);

Output: identified modules;

(1)For each edge e(u,v) ∈E do

      compute w _uv ; add e(u,v) to queue S _q

   End for

(2)While Sq ≠ ∅ do;

      e(u, v) ← S _q ;

      If L(u) ≠ L(v) then //L is cluster label

         i = L(u); j =L (v);

         If w _uv ==hw _u || w _uv == hw _v then

            V (C _i ) = V (C _i ) ∪ V(C _j ); //C represents the cluster

         End if

      End if

   End while