| Input Adjacency matrix of snapshot of the network |
| Output Community structures |
| (1) let be the graph of the snapshot of the network |
| (2) apply CN agglomerative algorithm to graph and get the |
| first level and second level community structures, respectively. |
| Let all the communities in the two community structure be one set |
| |
| (3) compute the minimum degree of the node in each community |
| , denoted by |
| (4) initialize a special set to be an empty set |
| //When new node is added to the network |
| (5) let |
| (6) if there exists some such that then |
| (7) among all such is, find the one that |
| maximizes , let the found index be |
| (8) insert node into community |
| (9) else |
| (10) insert node into the special set |
| (11) if // when more than new nodes are inserted into , where is a user-provided threshold |
| then |
| (12) apply CN agglomerative algorithm to , and get the |
| first level community structure and the second level community structure |
| (13) output the first level community structure and the second level community structure |
| (14) endif |
| (15) endif |
| (16) if new community appears |
| (17) output new community set |
| (18) endif |
