实现最小生成树算法,通过PRIM算法实现.通过输入一串字符显示最小生成树.求得最小路径-Realize minimum spanning tree algorithm, through the PRIM algorithm. By entering a string of characters show minimal spanning tree. Find the smallest path
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.001140s ]
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.072768s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001003s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001145s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.000924s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003078s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.000775s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.004563s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.014374s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.002103s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 139152 [ RunTime:0.018087s ]
