该程序用贪心算法来求解二分覆盖问题. 采用贪婪准则：每次从A中选择一个顶点加入覆盖，选择时：选取能覆盖B中还未被覆盖的顶点的数目最多的顶点。-procedures with the greedy algorithm to solve two hours coverage. Using greed criteria : A time to choose from a peak accession coverage options : To B coverage can not be covered by the largest number of vertices of the vertex.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001036s ]
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.069784s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001107s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001090s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000955s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003355s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000954s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003990s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.018899s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001146s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 125837 [ RunTime:0.017138s ]
