This software takes a network topology entry (coded as a list of edges) and finds a community partition of the graph using a local method.
The algorithm can be applied to moderately large networks, and has a complexity of O(n*kmax+m*log(n)).
It is based on a fitness function which grows monotonically as the process traverses the network graph.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001216s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.086897s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001165s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001907s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001245s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003615s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000971s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003250s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.015060s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001705s ]
UPDATE `jrk_articles` SET `hits` = 1 WHERE `id` = 238323 [ RunTime:0.001497s ]
