Algorithm GSM-CA |
---|
Input: a graph G = (V , E), parameters cn in ; Output: identified modules; (1) Compute the edge weight For each edge e(u,v) ∈E do compute w uv ; End For (2) Form core Select the edge e(u,v) with highest weight in G; If w uv < 1 then exit; End If Initial core C ={u,v}; While neighbour i whose neighbor j linked by i's highest weight edge is in C and cn ij ≥ cn in do C. add (i); End While (3) Select attachments for core For each neighbor u of the core C do If u's neighbor v linked by u's highest weight edge is in C and then u is selected as attachment of C End If End For each (4) Output results and update the highest edge weight Output C and delete C from G, update each vertex's highest edge weight in the remaining G (5) Repeat from step 2 to step 4, until reaching the termination condition of step 2. |