利用克鲁斯卡尔算法求网的最小生成树
是关于数据结构的课程设计的题目
是非常有用的-Kelushikaer algorithm for the use of the network is the minimum spanning tree data structure of the curriculum design is the subject of very useful
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001001s ]
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.074443s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001023s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001138s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000964s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003084s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000830s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.003499s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014525s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.001296s ]
UPDATE `jrk_articles` SET `hits` = 3 WHERE `id` = 69437 [ RunTime:0.015820s ]
